Construction and applications of knowledge graph of porphyry copper deposits

A knowledge graph is becoming popular due to its ability to describe the real world by using a graph language that can be understood by both humans and machines using computer technologies. A case study to construct the knowledge graph of porphyry copper deposits is presented in this paper. First of all, the raw text data is collected and integrated from selected porphyry copper deposits and porphyry-skarn copper deposits in the Qinzhou Bay – Hangzhou Bay metallogenic belt, South China. Second, the text's entities, relations, and attributes are labeled and extracted with reference to the conceptual model of porphyry copper deposits in the study area. The third, a knowledge graph of porphyry copper deposits, was constructed using Neo4j 4.3. The resulted knowledge graph of porphyry copper deposit has the basic functions of an application. Furthermore, as part of a planned integrated knowledge graph from a single deposit, through an upper-geared metallogenic series, to a high-top metallogenic province, the understanding from the present study may be extended to mineral resource prospectivity and assessment beyond today. The interrelationship between the earth system, the metallogenic system, the exploration system, and the prospectivity and assessment (ES-MS-ES-PS) should be completely understood, and a knowledge graph system for ES-MS-ES-PS is needed. The key scientific and technological problems for achieving the ES-MS-ES-PS knowledge graph system are included in the progressively relative system of the domain ontology and knowledge graph of ES-MS-ES-PS, the automatic construction technology of complicated ESMS-ES-PS domain ontology and knowledge graph, the self-evolution and complementary techniques for multi-modal correlation data embedding in the ES-MS-ES-PS knowledge graph, and the knowledge graph, big data mining and artificial intelligence based on ES-resource prospectivity, and assessment theory, and methods.

Bond graph observer for mode identification and discernibility study

This paper presents a new concept for calculating of the bond graph observer gains based on a graphical approach that investigates the Lyapunov Second Method in order to conclude about the observer stability and to search for the adequate gains that stabilize the observer. This new observer is used in the mode identification procedure. In fact, the observer’s residues allow the differentiation between the current mode and the other system modes. In order to guarantee the efficiency of the mode identification procedure, a new bond graph approach is proposed. It concerns the discernibility between the modes in bond graph language. First, it deals with the R-discernibility that introduces the definition of the discernibility through the structural parity residual then returns to a simple calculation of some matrices’ ranks in bond graph language. Second, another bond graph technique is applied to define the discernibility throughout the equivalency between the realizations.

Application of Graphics and Color Language in the Public Space of Modern Cites

It aims to explore the experience design application of graphics and color language in the modern urban public space.We concretely analyzed the response of the graph language and the public space, the resonance of color language and human's emotion,and the visual elements integrated into public space with people's coordination on a basis of experience from the daily life of modern urbanization with the crowd in close contact with the public space.We made a joint analysis of the link response with object perception experience in the public space between graphics and color language, and proposes relevant design and application rules.The rational design and application of graphic and color language in public space is an effective measure for people‘s behaviors that introduction of interactive and awakening of participation consciousness in space.Visual stimulation can effectively stimulate people 's emotional perception of square experience, and help to build a place which is oriented and identified with by the subject to meet the demands of the subject to create a beautiful experience and belonging in the urban public space.

Random graph languages

There tend to be no related researches regarding the relationships between graph theory and languages ever since the concept of graph-semigroup was first proposed in 1991. In 2011, after finding out the inner co-relations among digraphs, undirected graphs and languages, we proposed certain concepts including undirected graph language and digraph language; moreover, in 2014, we proposed a broaden concept–(V,R)-language and proved: (1) both undirected graph language and digraph language are (V,R)-languages; (2) both undirected graph language and digraph language are regular languages; (3) natural languages are regular languages. In this paper, we propose a new concept–Random Graph Language and build the relationships between random graph and language, which provides researchers with the possibility to do research about languages by using random graph theory.

On Semantic Graph Language Processing for Mobile Robot Voice Interaction

This paper describes a simple semantic graph based model for processing natural language commands issued to a mobile robot. The proposed model is intended for translating natural language commands given by naïve users into an action or sequence of actions that the robot can execute via its available functionality, in order to complete the commands. This approach to language processing is easily extensible through automated learning, it also is simpler and more scalable than hard-coded command to action mapping, while also being flexible and covering any number of command formulations that could be generated by a user.

Parallel Communicating String - Graph P System

The concept of parallel communicating grammar systems generating string languages is extended to string-graph P systems and their generative power is studied. It is also established that for every language L generated by a parallel communicating grammar system there exists an equivalent parallel communicating string-graph P system generating the string-graph language corresponding to L.