IndRT-GCNets: Knowledge Reasoning with Independent Recurrent Temporal Graph Convolutional Representations

Due to the structural dependencies among concurrent events in the knowledge graph and the substantial amount of sequential correlation information carried by temporally adjacent events,we propose an Independent Recurrent Temporal Graph Convolution Networks(IndRT-GCNets)framework to efficiently and accurately capture event attribute information.The framework models the knowledge graph sequences to learn the evolutionary represen-tations of entities and relations within each period.Firstly,by utilizing the temporal graph convolution module in the evolutionary representation unit,the framework captures the structural dependency relationships within the knowledge graph in each period.Meanwhile,to achieve better event representation and establish effective correlations,an independent recurrent neural network is employed to implement auto-regressive modeling.Furthermore,static attributes of entities in the entity-relation events are constrained andmerged using a static graph constraint to obtain optimal entity representations.Finally,the evolution of entity and relation representations is utilized to predict events in the next subsequent step.On multiple real-world datasets such as Freebase13(FB13),Freebase 15k(FB15K),WordNet11(WN11),WordNet18(WN18),FB15K-237,WN18RR,YAGO3-10,and Nell-995,the results of multiple evaluation indicators show that our proposed IndRT-GCNets framework outperforms most existing models on knowledge reasoning tasks,which validates the effectiveness and robustness.

A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information

Due to the presence of a large amount of personal sensitive information in social networks,privacy preservation issues in social networks have attracted the attention of many scholars.Inspired by the self-nonself discrimination paradigmin the biological immune system,the negative representation of information indicates features such as simplicity and efficiency,which is very suitable for preserving social network privacy.Therefore,we suggest a method to preserve the topology privacy and node attribute privacy of attribute social networks,called AttNetNRI.Specifically,a negative survey-based method is developed to disturb the relationship between nodes in the social network so that the topology structure can be kept private.Moreover,a negative database-based method is proposed to hide node attributes,so that the privacy of node attributes can be preserved while supporting the similarity estimation between different node attributes,which is crucial to the analysis of social networks.To evaluate the performance of the AttNetNRI,empirical studies have been conducted on various attribute social networks and compared with several state-of-the-art methods tailored to preserve the privacy of social networks.The experimental results show the superiority of the developed method in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topology disturbing and attribute hiding parts.The experimental results show the superiority of the developed methods in preserving the privacy of attribute social networks and demonstrate the effectiveness of the topological interference and attribute-hiding components.

MANAGEMENT OF SPATIO-TEMPORAL DATA OF CADASTRAL INFORMATION SYSTEM IN CHINA

Cadastral Information System (CIS) is designed for the office automation of cadastral management. With the development of the market economics in China, cadastral management is facing many new problems. The most crucial one is the temporal problem in cadastral management. That is, CIS must consider both spatial data and temporal data. This paper reviews the situation of the current CIS and provides a method to manage the spatiotemporal data of CIS, and takes the CIS for Guangdong Province as an example to explain how to realize it in practice.

Ontology Based Ocean Knowledge Representation for Semantic Information Retrieval

The drastic growth of coastal observation sensors results in copious data that provide weather information.The intricacies in sensor-generated big data are heterogeneity and interpretation,driving high-end Information Retrieval(IR)systems.The Semantic Web(SW)can solve this issue by integrating data into a single platform for information exchange and knowledge retrieval.This paper focuses on exploiting the SWbase systemto provide interoperability through ontologies by combining the data concepts with ontology classes.This paper presents a 4-phase weather data model:data processing,ontology creation,SW processing,and query engine.The developed Oceanographic Weather Ontology helps to enhance data analysis,discovery,IR,and decision making.In addition to that,it also evaluates the developed ontology with other state-of-the-art ontologies.The proposed ontology’s quality has improved by 39.28%in terms of completeness,and structural complexity has decreased by 45.29%,11%and 37.7%in Precision and Accuracy.Indian Meteorological Satellite INSAT-3D’s ocean data is a typical example of testing the proposed model.The experimental result shows the effectiveness of the proposed data model and its advantages in machine understanding and IR.

Flight parameter calculation method of multi-projectiles using temporal and spatial information constraint

The dynamic parameters of multiple projectiles that are fired using multi-barrel weapons in highfrequency continuous firing modes are important indicators to measure the performance of these weapons.The characteristics of multiple projectiles are high randomness and large numbers launched in a short period of time,making it very difficult to obtain the real dispersion parameters of the projectiles due to the occlusion or coincidence of multiple projectiles.Using six intersecting-screen testing system,in this paper,we propose an association recognition and matching algorithm of multiple projectiles using a temporal and spatial information constraint mechanism.We extract the output signal from each detection screen and then use the wavelet transform to process the output signal.We present a method to identify and extract the time values on which the projectiles pass through the detection screens using the wavelet transform modulus maximum theory.We then use the correlation of the output signals of three parallel detection screens to establish a correlation coefficient recognition constraint function for the multiple projectiles.Based on the premise of linear projectile motion,we establish a temporal and spatial constraint matching model using the projectile’s position coordinates in each detection screen and the projectile’s time constraints within the multiple intersecting-screen geometry.We then determine the time values of the multiple projectiles in each detection screen using an iterative search cycle registration,and finally obtain the flight parameters for the multiple projectiles in the presence of uncertainty.The proposed method and algorithm were verified experimentally and can solve the problem of uncertainty in projectiles flight parameter under different multiple projectile firing states.

Route Temporal⁃Spatial Information Based Residual Neural Networks for Bus Arrival Time Prediction

Bus arrival time prediction contributes to the quality improvement of public transport services.Passengers can arrange departure time effectively if they know the accurate bus arrival time in advance.We proposed a machine⁃learning approach,RTSI⁃ResNet,to forecast the bus arrival time at target stations.The residual neural network framework was employed to model the bus route temporal⁃spatial information.It was found that the bus travel time on a segment between two stations not only had correlation with the preceding buses,but also had common change trends with nearby downstream/upstream segments.Two features about bus travel time and headway were extracted from bus route including target section in both forward and reverse directions to constitute the route temporal⁃spatial information,which reflects the road traffic conditions comprehensively.Experiments on the bus trajectory data of route No.10 in Shenzhen public transport system demonstrated that the proposed RTSI⁃ResNet outperformed other well⁃known methods(e.g.,RNN/LSTM,SVM).Specifically,the advantage was more significant when the distance between bus and the target station was farther.

Shortest path of temporal networks:An information spreading-based approach

The shortest path is a widely studied network science problem and has attracted great attention.Nevertheless,it draws little attention in temporal networks,in which temporal edges determine information dissemination.In this paper,we propose an information spreading-based method to calculate the shortest paths distribution in temporal networks.We verify our method on both artificial and real-world temporal networks and obtain a good agreement.We further generalize our method to identify influential nodes and found an effective method.Finally,we verify the influential nodes identifying method on four networks.

Possible roles of electrical synapse in temporal information processing: A computational study

Temporal information processing in the range of tens to hundreds of milliseconds is critical in many forms of sensory and motor tasks. However, little has been known about the neural mechanisms of temporal information processing. Experimental observations indicate that sensory neurons of the nervous system do not show selective response to temporal properties of external stimuli. On the other hand, temporal selective neurons in the cortex have been reported in many species. Thus, processes which realize the temporal-to-spatial transformation of neuronal activities might be required for temporal information processing. In the present study, we propose a computational model to explore possible roles of electrical synapses in processing the duration of external stimuli. Firstly, we construct a small-scale network with neurons interconnected by electrical synapses in addition to chemical synapses. Basic properties of this small-scale neural network in processing duration information are analyzed. Secondly, a large-scale neural network which is more biologically realistic is further explored. Our results suggest that neural networks with electrical synapses functioning together with chemical synapses can effectively work for the temporal-to-spatial transformation of neuronal activities, and the spatially distributed sequential neural activities can potentially represent temporal information.

Short Video Recommendation Algorithm Incorporating Temporal Contextual Information and User Context

With the popularity of 5G and the rapid development of mobile terminals,an endless stream of short video software exists.Browsing short-form mobile video in fragmented time has become the mainstream of user’s life.Hence,designing an efficient short video recommendation method has become important for major network platforms to attract users and satisfy their requirements.Nevertheless,the explosive growth of data leads to the low efficiency of the algorithm,which fails to distill users’points of interest on one hand effectively.On the other hand,integrating user preferences and the content of items urgently intensify the requirements for platform recommendation.In this paper,we propose a collaborative filtering algorithm,integrating time context information and user context,which pours attention into expanding and discovering user interest.In the first place,we introduce the temporal context information into the typical collaborative filtering algorithm,and leverage the popularity penalty function to weight the similarity between recommended short videos and the historical short videos.There remains one more point.We also introduce the user situation into the traditional collaborative filtering recommendation algorithm,considering the context information of users in the generation recommendation stage,and weight the recommended short-formvideos of candidates.At last,a diverse approach is used to generate a Top-K recommendation list for users.And through a case study,we illustrate the accuracy and diversity of the proposed method.

Modeling of unsupervised knowledge graph of events based on mutual information among neighbor domains and sparse representation

Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,i.e.UKGE-MS.Specifically,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of samples.Firstly,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature items.Finally,the events knowledge graph is constructed by means of sparse representation and l1 norm.Extensive experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding algorithms.The experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.

Construction of Smart City Spatio-Temporal Information Cloud Platform in Weifang,China

On the basis of the digital Weifang geospatial framework,Smart Weifang spatio-temporal information cloud platform(WFCP)integrated legal person information,population,place name and address data,macroeconomic data and so on.And it also expanded the data contents,such as the indoor and outdoor data,the overground and underground data,panoramic data and real data.It also introduced the contents of historical geographical information in different periods and real-time location information,address information of sensing equipment,real-time perception and interpreting information.It has overcome the difficulties of real-time access of Internet of Things(IoT)perception,multi-node collaboration,64-bit support,cluster deployment and has the characteristics of spatio-temporal management,ondemand service,large data analysis and micro-service architecture.It built spatio-temporal information big data center and spatio-temporal information cloud platform,realized the convergence and management of the distributed big data,deeply applied for land,transportation,environmental protection,police and subdistrict five areas,by supporting the integrated application of multi-source information and supporting intelligent deep application.In the aspect of hardware environment construction,according to the top-level design and unified arrangement of Smart Weifang,the WFCP was migrated to Weifang cloud computing center,to achieve the on-demand computing resources and dynamic scheduling load-based computing resources,to support the generalizing load map application.

Concept-based approach for information retrieval

A concept-based approach is expected to resolve the word sense ambiguities in information retrieval and apply the semantic importance of the concepts, instead of the term frequency, to representing the contents of a document. Consequently, a formalized document framework is proposed. The document framework is used to express the meaning of a document with the concepts which are expressed by high semantic importance. The framework consists of two parts： the ＂domain＂ information and the ＂situation ＆ background＂ information of a document. A document-extracting algorithm and a two-stage smoothing method are also proposed. The quantification of the similarity between the query and the document framework depends on the smoothing method. The experiments on the TREC6 collection demonstrate the feasibility and effectiveness of the proposed approach in information retrieval tasks. The average recall level precision of the model using the proposed approach is about 10% higher than that of traditional ones.

Event temporal relation computation based on machine learning

Temporal relation computation is one of the tasks of the extraction of temporal arguments from event, and it is also the ultimate goal of temporal information processing. However, temporal relation computation based on machine learning requires a lot of hand-marked work, and exploring more features from discourse. A method of two-stage machine learning based on temporal relation computation （TSMLTRC） is proposed in this paper for the shortcomings of current temporal relation computation between two events. The first stage is to get the main temporal attributes of event based on classification learning. The second stage is to compute the event temporal relation in the discourse through employing the result of the first stage as the basic features, and also employing some new linguistic characteristics. Experiments show that, compared with the artificial golden rule, the computational efficiency in the first stage is much higher, and the F1-Score of event temporal relation which is computed through combining multi-features may be increased at 85.8% in the second stage.

Future Event Prediction Based on Temporal Knowledge Graph Embedding

Accurate prediction of future events brings great benefits and reduces losses for society in many domains,such as civil unrest,pandemics,and crimes.Knowledge graph is a general language for describing and modeling complex systems.Different types of events continually occur,which are often related to historical and concurrent events.In this paper,we formalize the future event prediction as a temporal knowledge graph reasoning problem.Most existing studies either conduct reasoning on static knowledge graphs or assume knowledges graphs of all timestamps are available during the training process.As a result,they cannot effectively reason over temporal knowledge graphs and predict events happening in the future.To address this problem,some recent works learn to infer future events based on historical eventbased temporal knowledge graphs.However,these methods do not comprehensively consider the latent patterns and influences behind historical events and concurrent events simultaneously.This paper proposes a new graph representation learning model,namely Recurrent Event Graph ATtention Network(RE-GAT),based on a novel historical and concurrent events attention-aware mechanism by modeling the event knowledge graph sequence recurrently.More specifically,our RE-GAT uses an attention-based historical events embedding module to encode past events,and employs an attention-based concurrent events embedding module to model the associations of events at the same timestamp.A translation-based decoder module and a learning objective are developed to optimize the embeddings of entities and relations.We evaluate our proposed method on four benchmark datasets.Extensive experimental results demonstrate the superiority of our RE-GAT model comparing to various base-lines,which proves that our method can more accurately predict what events are going to happen.

A novel method to reconstruct phylogeny tree based on thechaos game representation

We developed a new approach for the reconstruction of phylogeny trees based on the chaos game representation (CGR) of biological sequences. The chaos game representation (CGR) method generates a picture from a biological sequence, which displays both local and global patterns. The quantitative index of the biological sequence is extracted from the picture. The Kullback-Leibler discrimination information is used as a diversity indicator to measure the dissimilarity of each pair of biological sequences. The new method is inspected by two data sets: the Eutherian orders using concatenated H-stranded amino acid sequences and the genome sequence of the SARS and coronavirus. The phylogeny trees constructed by the new method are consistent with the commonly accepted ones. These results are very promising and suggest more efforts for further developments.

Nondeterministic Temporal Relations in Multimedia Data

Synchronization is a important issue in multimedia systems which integrate a variety oftemporally related media objects.One part of synchronization is the representation of tempo-ral information.With the emerging interaetive multimedia,deterministic temporal modelsare replaced by nondeterministic ones with more expressiveness.This paper classifies tempo-ral models by their expressiveness,and evaluates the relevant nondetermi.nistic temporal re-lations in multimedia data.Additionally,an interval-based nondeterministie model based ona complete temporal operator set is proposed,providing high-level abstractions and a highdegree of expressiveness for interactive multimedia systems.

Knowledge Representation in Patient Safety Reporting: An Ontological Approach

Purpose： The current development of patient safety reporting systems is criticized for loss of information and low data quality due to the lack of a uniformed domain knowledge base and text processing functionality. To improve patient safety reporting, the present paper suggests an ontological representation of patient safety knowledge. Design/methodology/approach： We propose a framework for constructing an ontological knowledge base of patient safety. The present paper describes our design, implementation,and evaluation of the ontology at its initial stage. Findings： We describe the design and initial outcomes of the ontology implementation. The evaluation results demonstrate the clinical validity of the ontology by a self-developed survey measurement. Research limitations： The proposed ontology was developed and evaluated using a small number of information sources. Presently, US data are used, but they are not essential for the ultimate structure of the ontology.Practical implications： The goal of improving patient safety can be aided through investigating patient safety reports and providing actionable knowledge to clinical practitioners.As such, constructing a domain specific ontology for patient safety reports serves as a cornerstone in information collection and text mining methods.Originality/value： The use of ontologies provides abstracted representation of semantic information and enables a wealth of applications in a reporting system. Therefore, constructing such a knowledge base is recognized as a high priority in health care.

Constructing a raster-based spatio-temporal hierarchical data model for marine fisheries application

Marine information has been increasing quickly. The traditional database technologies have disadvantages in manipulating large amounts of marine information which relates to the position in 3-D with the time. Recently, greater emphasis has been placed on GIS （geographical information system）to deal with the marine information. The GIS has shown great success for terrestrial applications in the last decades, but its use in marine fields has been far more restricted. One of the main reasons is that most of the GIS systems or their data models are designed for land applications. They cannot do well with the nature of the marine environment and for the marine information. And this becomes a fundamental challenge to the traditional GIS and its data structure. This work designed a data model, the raster-based spatio-temporal hierarchical data model （RSHDM）, for the marine information system, or for the knowledge discovery fi＇om spatio-temporal data, which bases itself on the nature of the marine data and overcomes the shortages of the current spatio-temporal models when they are used in the field. As an experiment, the marine fishery data warehouse （FDW） for marine fishery management was set up, which was based on the RSHDM. The experiment proved that the RSHDM can do well with the data and can extract easily the aggregations that the management needs at different levels.

Temporal-spatial Analysis on Urban and Rural Drinking Water Health Monitoring of Tianjin in 2013

Objective Grasp quality and health status of drinking water, and provide scientific basis for decision making of health administrative de- partment. Method According to the Standards for Drinking Water Quality （ GB 5749 -2006）, monitoring results of Tianjin urban and rural drinking water health in 2013 were evaluated, and software SPSS 20.0 and GeoDa was used for temporal-spatial analysis on water quality. Result There were 2 882 copies of monitoring samples in total, in which both finished water and tap water of urban district were qualified, while qualified rates of tap water and secondary water supply from the county were respectively 86.36% and 93.91%, and major exceeding indexes were pH and total number of colonies. Qualified rates of tap water and secondary water supply from the county had difference（x2 = 1 576.875, P 〈0.01 ）. Quality of tap water（ X2 = 5.425, P 〉 0.05） and secondary water supply （X2 = 16.009, P 〉 0.05） was stable at temporal distribution （ January-December）, but spatial distribution of tap water had certain regional difference（x2 = 1 255.802, P 〈0.01 ）. Conclusion General quality situation of Tianjin urban and rural drinking water was better, but qualified rate of water quality in some counties was lower, which had safety risk and threatened the health of residents in the corresponding county. The related departments should enhance the supervision and management of drinking water supply, im- prove supply water quality, strengthen water quality monitoring, and guarantee drinking water safety. Geographic information system can better real- ize visualization of drinking water quality monitoring information.