Asymmetric image encryption algorithm based on a new three-dimensional improved logistic chaotic map

Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.

Design and Realization of Block Level Augmented Reality Three-Dimensional Map

In response to the construction needs of “Real 3D China”, the system structure, functional framework, application direction and product form of block level augmented reality three-dimensional map is designed. Those provide references and ideas for the later large-scale production of augmented reality three-dimensional map. The augmented reality three-dimensional map is produced based on skyline software. Including the map browsing, measurement and analysis and so on, the basic function of three-dimensional map is realized. The special functional module including housing management, pipeline management and so on is developed combining the need of residential quarters development, that expands the application fields of augmented reality three-dimensional map. Those lay the groundwork for the application of augmented reality three-dimensional map. .

A modified method of discontinuity trace mapping using three-dimensional point clouds of rock mass surfaces

This paper presents an automated method for discontinuity trace mapping using three-dimensional point clouds of rock mass surfaces.Specifically,the method consists of five steps:(1)detection of trace feature points by normal tensor voting theory,(2)co ntraction of trace feature points,(3)connection of trace feature points,(4)linearization of trace segments,and(5)connection of trace segments.A sensitivity analysis was then conducted to identify the optimal parameters of the proposed method.Three field cases,a natural rock mass outcrop and two excavated rock tunnel surfaces,were analyzed using the proposed method to evaluate its validity and efficiency.The results show that the proposed method is more efficient and accurate than the traditional trace mapping method,and the efficiency enhancement is more robust as the number of feature points increases.

Three-dimensional computed tomography mapping of posterior malleolar fractures

BACKGROUND Posterior malleolar fractures have been reported to occur in<40%of ankle fractures.AIM To reveal the recurrent patterns and characteristics of posterior malleolar fractures by creating fracture maps of the posterior malleolar fractures through the use of computed tomography mapping.METHODS A consecutive series of posterior malleolar fractures was used to create threedimensional reconstruction images,which were oriented and superimposed to fit an ankle model template by both aligning specific biolandmarks and reducing reconstructed fracture fragments.Fracture lines were found and traced in order to generate an ankle fracture map.RESULTS This study involved 112 patients with a mean age of 49,comprising 32 pronationexternal rotation grade IV fractures and 80 supination-external rotation grade IV fractures according to the Lauge-Hansen classification system.Three-dimensional maps showed that the posterior ankle fracture fragments in the supinationexternal rotation grade IV group were relatively smaller than those in the pronation-external rotation grade IV group after posterior malleolus fracture.In addition,the distribution analyses on posterior malleolus fracture lines indicated that the supination-external rotation grade IV group tended to have higher linear density but more concentrated and orderly distribution fractures compared to the pronation-external rotation grade IV group.CONCLUSION Fracture maps revealed the fracture characteristics and recurrent patterns of posterior malleolar fractures,which might help to improve the understanding of ankle fracture as well as increase opportunities for follow-up research and aid clinical decision-making.

Studies of phase return map and symbolic dynamics in a periodically driven Hodgkin–Huxley neuron

How neuronal spike trains encode external information is a hot topic in neurodynamics studies. In this paper, we investigate the dynamical states of the Hodgkin-Huxley neuron under periodic forcing. Depending on the parameters of the stimulus, the neuron exhibits periodic, quasiperiodic and chaotic spike trains. In order to analyze these spike trains quantitatively, we use the phase return map to describe the dynamical behavior on a one-dimensional （1D） map. According to the monotonicity or discontinuous point of the 1D map, the spike trains are transformed into symbolic sequences by implementing a coarse-grained algorithm -- symbolic dynamics. Based on the ordering rules of symbolic dynamics, the parameters of the external stimulus can be measured in high resolution with finite length symbolic sequences. A reasonable explanation for why the nervous system can discriminate or cognize the small change of the external signals in a short time is also presented.

A method of recovering the initial vectors of globally coupled map lattices based on symbolic dynamics

Based on symbolic dynamics, a novel computationally efficient algorithm is proposed to estimate the unknown initial vectors of globally coupled map lattices （CMLs）. It is proved that not all inverse chaotic mapping functions are satisfied for contraction mapping. It is found that the values in phase space do not always converge on their initial values with respect to sufficient backward iteration of the symbolic vectors in terms of global convergence or divergence （CD）. Both CD property and the coupling strength are directly related to the mapping function of the existing CML. Furthermore, the CD properties of Logistic, Bernoulli, and Tent chaotic mapping functions are investigated and compared. Various simulation results and the performances of the initial vector estimation with different signal-to- noise ratios （SNRs） are also provided to confirm the proposed algorithm. Finally, based on the spatiotemporal chaotic characteristics of the CML, the conditions of estimating the initial vectors usiug symbolic dynamics are discussed. The presented method provides both theoretical and experimental results for better understanding and characterizing the behaviours of spatiotemporal chaotic systems.

A method of estimating initial conditions of coupled map lattices based on time-varying symbolic dynamics

A novel computationally efficient algorithm in terms of the time-varying symbolic dynamic method is proposed to estimate the unknown initial conditions of coupled map lattices （CMLs）. The presented method combines symbolic dynamics with time-varying control parameters to develop a time-varying scheme for estimating the initial condition of multi-dimensional spatiotemporal chaotic signals. The performances of the presented time-varying estimator in both noiseless and noisy environments are analysed and compared with the common time-invariant estimator. Simulations are carried out and the obtained results show that the proposed method provides an efficient estimation of the initial condition of each lattice in the coupled system. The algorithm cannot yield an asymptotically unbiased estimation due to the effect of the coupling term, but the estimation with the time-varying algorithm is closer to the Cramer-Rao lower bound （CRLB） than that with the time-invariant estimation method, especially at high signal-to-noise ratios （SNRs）.

Symbolic dynamics of Belykh-type maps

The symbolic dynamics of a Belykh-type map （a two-dimensional discon- tinuous piecewise linear map） is investigated. The admissibility condition for symbol sequences named the pruning front conjecture is proved under a hyperbolicity condition. Using this result, a symbolic dynamics model of the map is constructed according to its pruning front and primary pruned region. Moreover, the boundary of the parameter region in which the map is chaotic of a horseshoe type is given.

Balanced Functional Maps for Three-Dimensional Non-Rigid Shape Registration

Three-dimensional(3D)shape registration is a challenging problem,especially for shapes under non-rigid transformations.In this paper,a 3D non-rigid shape registration method is proposed,called balanced functional maps(BFM).The BFM algorithm generalizes the point-based correspondence to functions.By choosing the Laplace-Beltrami eigenfunctions as the function basis,the transformations between shapes can be represented by the functional map(FM)matrix.In addition,many constraints on shape registration,such as the feature descriptor,keypoint,and salient region correspondence,can be formulated linearly using the matrix.By bi-directionally searching for the nearest neighbors of points’indicator functions in the function space,the point-based correspondence can be derived from FMs.We conducted several experiments on the Topology and Orchestration Specification for Cloud Applications(TOSCA)dataset and the Shape Completion and Animation of People(SCAPE)dataset.Experimental results show that the proposed BFM algorithm is effective and has superior performance than the state-of-the-art methods on both datasets.

Application of Three-dimensional Laser Scanning Technology in the Teaching Practice of Surveying and Mapping of Ancient Buildings

Based on the study of the application of three-dimensional laser scanning technology in ancient building surveying and mapping,this paper briefly describes the working principle and flow of three-dimensional laser scanning technology.Based on the practical application,this paper puts forward the discussion of related problems and matters needing attention.This has a certain reference significance for the study of new technology in surveying and mapping of ancient buildings.

Syntactic Characteristics and a Smart Construction Mechanism for Thematic Map Symbols

The construction of thematic map symbols is a very complex and intellectually demanding process,but thematic symbols can be automatically generated and easily shared on the web using the syntactic structure of semantic symbols.In this paper,the symbol types,inner structure,and design pattern are discussed.A syntactic construction theory based on letter (thematic maps primitive)-word (single thematic symbol)-sentence (combined symbols or complex symbols) structure model is proposed to automate the construction of thematic map symbols.As a result of this research,symbols can be defined using cartographic primitives which are arranged according to syntactic principles.A semiotic model and word-centered construction theory can be integrated into interactive cartography as represented by the technology of Internet.Finally,the concepts and schema of this theory are discussed,and some examples are presented based a web thematic cartographic system to verify its utility.

On new chaotic mappings in symbol space

A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,say at unit time apart（a shift mapping）,but at a set of times which are not equally spaced,say if the unit time can not be fixed.The increasing mapping as a generalization of the shift mapping and the k-switch mapping are introduced.The increasing and k-switch mappings are chaotic.

Algorithm of symbol generation and configuration of land polygons in present land-use map

The symbolization of land polygon is an important part of cartography. In the mapping of traditional present land-use maps, the symbol of land polygons was usually filled by the method of filling or plotting, but these methods can't solve the spatial conflicts of the symbol. According to the principle of cartography, the rule of how to symbolize the land polygon was summarized, and a new method that can generate and deploy the land symbols was presented. By making use of C# programming language and Arc Engine developing components, the algorithm can generate land symbols presenting triangle and adjust the coordinate of the symbol. Through mapping the present land-use map of Honghe county, this algorithm can reduce 88.84% of the spatial conflicts error rate compared with the traditional methods. It improves the accuracy and efficiency of the map symbolic.

Admissibility Conditions for Symbolic Sequences in Dynamics of Digital Filter with Two's Complement Arithmetic

In this paper, we discuss a class of piecewise linear hyperbolic maps on the 2-torus. These maps arise in the second-order digital fdter with two＇ s complement arithmetic. By introducing codings underlying the map operations, we give some admissibility conditions for symbolic sequences and find some periodic properties of these symbolic sequences. Then we use these conditions to check the admissibility of periodic symbol sequences.

Dynamics analysis on neural firing patterns by symbolic approach

Neural firing patterns are investigated by using symbolic dynamics. Bifurcation behaviour of the Hindmarsh-Rose （HR） neuronal model is simulated with the external stimuli gradually decreasing, and various firing activities with different topological structures are orderly numbered. Through constructing first-return maps of interspike intervals, all firing patterns are described and identified by symbolic expressions. On the basis of ordering rules of symbolic sequences, the corresponding relation between parameters and firing patterns is established, which will be helpful for encoding neural information. Moreover, using the operation rule of ＊ product, generation mechanisms and intrinsic configurations of periodic patterns can be distinguished in detail. Results show that the symbolic approach is a powerful tool to study neural firing activities. In particular, such a coarse-grained way can be generalized in neural electropt/ysiological experiments to extract much valuable information from complicated experimental data.

An Anti-aliasing Algorithm Suitable to Map Publishing Symbol

On the basis of analysis of various algorithms, an anti-aliasing algorithm called brush method was presented, which is suitable to map publishing symbol. Aftes introducing the basic principle and implementation of brush method in detail, the result and efficiency were evaluated through experiments.

Enhanced cooperative packet retransmission employing joint cooperative diversity and symbol mapping diversity

A joint cooperation diversity and symbol mapping diversity (SMD) strategy is proposed for cooperative packet retransmission system with high-order modulation such as 16QAM. Substantial SER/BER (symbol error rate/bit error rate) gains result from multiple packet transmissions over independent paths and distinct bit-to-symbol mappings for each packet transmis-sion. The SER/BER performance of relay assisted retransmission system is analyzed. Simulation results show that the joint-diversity strategy can provide more BER gains than other relaying strategies (i.e., decode-and-forward and constellation rearrangement relaying strategies) when no relay makes a decision error; but if some relays make decision errors, the joint-di-versity strategy outperforms other relaying strategies only when the relays are closer to the source than to the destination.

采用FME和ArcMap实现地形图制作服务

为了实现数字地形图DLG快速制作地图服务,解决数据格式转换和数字地形图DLG符号自动匹配的问题,采用FME空间数据转换系统实现CASS DWG至GIS GDB数据格式的无缝转换,且保留所需的属性信息,如图层名、要素编码、角度等;采用ArcMap相关功能模块,将要素编码与ArcMap符号库关联起来,实现要素与符号的自动匹配,从而实现数字地形图DLG快速制作地图服务及其衍生的各类专题图制作服务。

基于MAPGIS的全国地质工作程度数据库应用系统设计与实现

二十世纪在全国开展了大量地质调查工作,并且建立起“全国地质工作程度空间数据库”,急需研发应用系统保障该数据库作用的充分发挥。这里运用GIS软件工程原理,对应用系统进行了需求分析和系统分析,特别是对各重要模块进行了详细设计。该应用系统已基于MAPGIS 6.x实现,几项特色功能被重点展示,它们为保障整个系统功能起到了关键性的作用。

基于Autodesk Map地图符号库的设计与开发

在地图数字化过程中,经常需要使用一些专门的点、线、面符号来表示特定的地物,而在AutodeskMap的标准符号库中没有这类地图符号.为避免重复繁琐地绘制这些符号实体,在AutodeskMap环境下,依据地图符号的一般特点和编码原则,根据点、线和面符号复杂程度和结构形状的不同,采用定制法、PDB开发方法和ObjectARX二次开发方法,设计并创建了特定地物的地图符号库.