PARAMETRIC REPRESENTATIONS OF QUASICONFORMAL MAPPINGS

In this article,we first give two simple examples to illustrate that two types of parametric representation of the family ofΣ0 K have some gaps.Then we also find that the area derivative formula(1.6),which is used to estimate the area distortion ofΣ0 K,cannot be derived from[6],but that formula still holds forΣ0 K through our amendatory parametric representation for the one obtained by Eremenko and Hamilton.

The Cartography and the Spatial Representations:Search by Perfect Map

The activities of the professionals working on cartographic products have been highlighted especially in recent years. The history, the concepts and categories of cartography cannot be neglected in using this type of tool since the use of elements that make a cartographic product, as an example: map, chart, plan, globe, and a scale model should be used since the unawareness of techniques of cartography and the absence of the components of a map may hinder the understanding of what is intended to represent cartographically. This text is a contribution to the discussion of advances in cartography including errors and absence of maps, including a brief discussion of the characteristics of cartographic language nowadays and the search for perfection in cartography.

Navigation Map Data Representation and Parallel Display Algorithm in an Embedded Environment

Map data display is the basic information representation mode under embedded real-time navigation. After a navigation display data set （NDIS_SET） with several dimensions and corresponding mathematical description formula are designed, a series of rules and algorithms are advanced to optimize embedded navigation data and promote data index and input efficiency. A new parallel display algorithm with navigation data named N PDIS is then presented to adapt to limited embedded resources of computation and memory after a normal navigation data display algorithm named NDIS and related problems are analyzed, N_PDIS can synchronously create two preparative bitmapa by two parallel threads and switch one of them to screen automatically. Compared with NDIS, the results show that N_PDIS is more effective in improving display efficiency.

THE PARAMETRIC REPRESENTATION FOR SPIRAL-LIKE MAPPINGS OF TYPEαON BOUNDED BALANCED PSEUDOCONVEX DOMAINS

Let Ω be a bounded balanced pseudoconvex domain in C^n that admits a plurisubhamonic defining function of class C^2. The authors prove that if f is a spiral-like mapping of type a on Ω, then f can be expressed as a limiting form concerning a Schwarz mapping. Moreover, the characteristics for star-like mappings and spiral-like mappings of type α are obtained. As a direct application, the growth theorem for spiral-like mappings of type α is set up.

An Integral Representation of a Family of Slit Mappings

We consider a normalized family F of analytic functions f, whose common domain is the complement of a closed ray in the complex plane. If f(z) is real when z is real and the range of f does not intersect the nonpositive real axis, then f can be reproduced by integrating the biquadratic kernel against a probability measure u(t) . It is shown that while this integral representation does not characterize the family F, it applies to a large class of functions, including a collection of functions which multiply the Hardy space Hp into itself.

The Parametric Representation for Starlike Mappings on Bounded Starlike Circular Domains

In this paper,the parametric representation of starlike mappings is given.As a direct application,the growth theorem is set up.Moreover,a character of starlike mappings is obtained.

Mapped Finite Element Discrete Variable Representation

Efficient numerical solver for the SchrSdinger equation is very important in physics and chemistry. The finite element discrete variable representation （FE-DVR） was first proposed by Rescigno and Mc-Curdy [Phys. Rev. A 62, 032706 （2000）] for solving quantum-mechanical scattering problems. In this work, an FE-DVR method in a mapped coordinate was proposed to improve the efficiency of the original FE-DVR method. For numerical demonstration, the proposed approach is applied for solving the electronic eigenfunctions and eigenvalues of the hydrogen atom and vibrational states of the electronic state 3E＋ of the Cs2 molecule which has long-range interaction potential. The numerical results indicate that the numerical efficiency of the original FE-DVR has been improved much using our proposed mapped coordinate scheme.

基于Topic Map的知识表示技术研究

以 Topic Map主题地图作为语义 Web信息描述模型 ,阐述了 Topic Map在 Web资源组织中的作用和地位 ,研究了 TM结构化知识表示向形式化逻辑的映射机制 ,以及基于

On Spirallike Mappings in Several Complex Variables

In this paper,the parametric representation of a kind of spirallike mappings is given. As a direct application,the growth Theorem is set up. Moreover,a character of starlike mappings and a kind of spirallike mappings is obtained.

Chinese Fuzzy Ontology Mapping Based on Support Vector Machine

Taking into account that fuzzy ontology mapping has wide application and cannot be dealt with in many fields at present,a Chinese fuzzy ontology model and a method for Chinese fuzzy ontology mapping are proposed.The mapping discovery between two ontologies is achieved by computing the similarity between the concepts of two ontologies.Every concept consists of four features of concept name,property,instance and structure.First,the algorithms of calculating four individual similarities corresponding to the four features are given.Secondly,the similarity vectors consisting of four weighted individual similarities are built,and the weights are the linear function of harmony and reliability.The similarity vector is used to represent the similarity relation between two concepts which belong to different fuzzy ontolgoies.Lastly,Support Vector Machine(SVM) is used to get the mapping concept pairs by the similarity vectors.Experiment results are satisfactory.

Multi-scale Representation of Building Feature in Urban GIS

This paper aims at multi_scale representation of urban GIS,presenting a model to dynamically generalize the building on the basis of Delaunay triangulation model.Considering the constraints of position accuracy,statistical area balance and orthogonal characteristics in building cluster generalization,this paper gives a progressive algorithm of building cluster aggregation,including conflict detection (where),object (who) displacement,and geometrical combination operation (how).The algorithm has been realized in an interactive generalization system and some experiment illustrations are provided.

Mineral Prospectivity Mapping Method Integrating Multi-Sources Geology Spatial Data Sets and Case-Based Reasoning

Extracting and synthesizing information from existing and massive amounts of geology spatial data sets is of great scientific significance and has considerable value in its applications. To make mineral exploration less expensive, more efficient, and more accurate, it is important to move beyond traditional concepts and establish a rapid, efficient, and intelligent method of predicting the existence and location of minerals. This paper describes a case-based reasoning (CBR) method for mineral prospectivity mapping that takes spatial features of geology data into account and offers an intelligent approach. This method include a metallogenic case representation that combines spatial and attribute features, metallogenic case-based storage organization, and a metallogenic case similarity retrieval model. The experiments were performed in the eastern Kunlun Mountains, China using CBR and weights-of-evidence (WOE), respectively. The results show that the prediction accuracy of the CBR is higher than that of the WOE.

A New Method of Semantic Network Knowledge Representation Based on Extended Petri Net

Abstract： It was discussed that the way to reflect the internal relations between judgment and identification, the two most fundamental ways of thinking or cognition operations, during the course of the semantic network knowledge representation processing. A new extended Petri net is defined based on qualitative mapping, which strengths the expressive ability of the feature of thinking and the mode of action of brain. A model of semantic network knowledge representation based on new Petri net is given. Semantic network knowledge has a more efficient representation and reasoning mechanism. This model not only can reflect the characteristics of associative memory in semantic network knowledge representation, but also can use Petri net to express the criterion changes and its change law of recognition judgment, especially the cognitive operation of thinking based on extraction and integration of sensory characteristics to well express the thinking transition course from quantitative change to qualitative change of human cognition.

Combining Multi-scale Directed Depth Motion Maps and Log-Gabor Filters for Human Action Recognition

Recognition of the human actions by computer vision has become an active research area in recent years. Due to the speed and the high similarity of the actions, the current algorithms cannot get high recognition rate. A new recognition method of the human action is proposed with the multi-scale directed depth motion maps(MsdDMMs) and Log-Gabor filters. According to the difference between the speed and time order of an action, MsdDMMs is proposed under the energy framework. Meanwhile, Log-Gabor is utilized to describe the texture details of MsdDMMs for the motion characteristics. It can easily satisfy both the texture characterization and the visual features of human eye. Furthermore, the collaborative representation is employed as action recognition by the classification. Experimental results show that the proposed algorithm, which is applied in the MSRAction3 D dataset and MSRGesture3 D dataset, can achieve the accuracy of 95.79% and 96.43% respectively. It also has higher accuracy than the existing algorithms, such as super normal vector(SNV), hierarchical recurrent neural network(Hierarchical RNN).

METHOD OF HIGH-LEVEL TECHNOLOGY MAPPING BASED ON KNOWLEDGE(RULE)

This paper studies the linkage problem between the result of high-level synthesis and back-end technology, presents a method of high-level technology mapping based on knowl edge, and studies deeply all of its important links such as knowledge representation, knowledge utility and knowledge acquisition. It includes: (1) present a kind of expanded production about knowledge of circuit structure; (2) present a VHDL-based method to acquire knowledge of tech nology mapping; (3) provide solution control strategy and algorithm of knowledge utility; (4)present a half-automatic maintenance method, which can find redundance and contradiction of knowledge base; (5) present a practical method to embed the algorithm into knowledge system to decrease complexity of knowledge base. A system has been developed and linked with three kinds of technologies, so verified the work of this paper.

Building of cognizing semantic map in large-scale semi-unknown environment

The quick response code based artificial labels are applied to provide semantic concepts and relations of surroundings that permit the understanding of complexity and limitations of semantic recognition and scene only with robot's vision.By imitating spatial cognizing mechanism of human,the robot constantly received the information of artificial labels at cognitive-guide points in a wide range of structured environment to achieve the perception of the environment and robot navigation.The immune network algorithm was used to form the environmental awareness mechanism with "distributed representation".The color recognition and SIFT feature matching algorithm were fused to achieve the memory and cognition of scenario tag.Then the cognition-guide-action based cognizing semantic map was built.Along with the continuously abundant map,the robot did no longer need to rely on the artificial label,and it could plan path and navigate freely.Experimental results show that the artificial label designed in this work can improve the cognitive ability of the robot,navigate the robot in the case of semi-unknown environment,and build the cognizing semantic map favorably.

Completely Positive Definite Maps Over Topological-algebras

In this paper, we discuss completely positive definite maps over topological algebras. A Schwarz type inequality for n-positive definite maps, and the Stinespring representation theorem for completely positive definite maps over topological algebras are given.

Researches on Cartographic Database-Based Interactive Three-Dimensional Topographic Map

With the development of computer graphics, the three-dimensional (3D) visualization brings new technological revolution to the traditional cartography. Therefore, the topographic 3D-map emerges to adapt to this technological revolution, and the applications of topographic 3D-map are spread rapidly to other relevant fields due to its incomparable advantage. The researches on digital map and the construction of map database offer strong technical support and abundant data source for this new technology, so the research and development of topographic 3D-map will receive greater concern. The basic data of the topographic 3D-map are rooted mainly in digital map and its basic model is derived from digital elevation model (DEM) and 3D-models of other DEM-based geographic features. In view of the potential enormous data and the complexity of geographic features, the dynamic representation of geographic information becomes the focus of the research of topographic 3D-map and also the prerequisite condition of 3D query and analysis. In addition to the equipment of hardware that are restraining, to a certain extent, the 3D representation, the data organization structure of geographic information will be the core problem of research on 3D-map. Level of detail (LOD), space partitioning, dynamic object loading (DOL) and object culling are core technologies of the dynamic 3D representation. The object- selection, attribute-query and model-editing are important functions and interaction tools for users with 3D-maps provided by topographic 3D-map system, all of which are based on the data structure of the 3D-model. This paper discusses the basic theories, concepts and cardinal principles of topographic 3D-map, expounds the basic way to organize the scene hierarchy of topographic 3D-map based on the node mechanism and studies the dynamic representation technologies of topographic 3D-map based on LOD, space partitioning, DOL and object culling. Moreover, such interactive operation functions are explored, in this paper, as spatial query, scene editing and management of topographic 3D-map. Finally, this paper describes briefly the applications of topographic 3D-map in its related fields.

自主式情境化地图表达:大模型时代的智能化地图制图理论探讨

通过智能化提升制图技术,让制图系统能全自动地完成地图设计与制作,一直是地图学界追求的目标,也一直是国际地图制图协会的前沿研究方向。从20世纪80年代开始,人工智能技术在地图学领域开始应用,逐步解决了部分工序的自动化问题,提高了地图制图的生产效率。然而,地图设计等关键环节的自动化水平仍然极低,无法满足信息时代的“定制化”“泛在化”制图需求。可喜的是,2023年以来,以GPT-4和Gemini等大语言模型(简称“大模型”)为代表的人工智能技术取得了突破,达到了“准通用人工智能”,表现出令人惊叹的语言理解力、推理能力和表达能力。基于此,本文探讨利用大模型来提升地图制图系统的智能水平,旨在建立新一代智能化制图理论与方法体系。首先,分析现有数字制图系统的瓶颈问题,指出建立新一代智能化制图技术的必要性;其次,分析大模型的性质与能力,论证建立新一代智能化制图技术的充分性;然后,进一步分析它们相结合的可能与方式,提出一个大模型时代的智能制图模式,并根据其根本性质与表征,将之称为情境化地图表达;最后,讨论情境化地图表达的关键技术问题,即自主觉知用图情境、自主设计制作地图及随境自主人机交互。

The Local Theory of Completely 1-Summing Mapping Spaces

In this paper, we investigate local properties in the system of completely 1-summing mapping spaces. We introduce notions of injectivity, local reflexivity, exactness, nuclearity and finite-representability in the system of completely 1-summing mapping spaces. First we obtain that if V has WEP, V is locally reflexive in the system (Ⅱ1(⋅,⋅), π1(⋅)) if and only if it is locally reflexive in the system (Ⅰ(⋅,⋅), t(⋅)). Furthermore we prove that an operator space V ⊆ B(H) is exact in the system (Ⅱ1(⋅,⋅), π1(⋅)) if and only if V is finitely representable in {Mn}n∈N in the system (Ⅱ1(⋅,⋅), π1(⋅)). At last, we show that an operator space V is finitely representable in {Mn}n∈N in the system (Ⅱ1(⋅,⋅), π1(⋅)) if and only if V = C.