- Book Chapter
- 10.1016/b978-0-12-409548-9.12016-0
Numerical Modeling of Tectonic Processes
- Oct 09, 2019
- Reference Module in Earth Systems and Environmental Sciences
- Fabio A Capitanio + 2 more +2
Numerical Modeling of Tectonic Processes
We address the problem of modeling the occurrence process of events for visiting attractive places, called points-of-interest (POIs), in a sightseeing city in the setting of a continuous time-axis and a continuous spatial domain, which is referred to as modeling geographical attention dynamics. By combining a Hawkes process with a time-varying Gaussian mixture model in a novel way and incorporating the influence structure depending on time slots as well, we propose a probabilistic model for discovering the spatio-temporal influence structure among major sightseeing areas from the viewpoint of geographical attention dynamics, and aim to accurately predict POI visit events in the near future. We develop an efficient method of inferring the parameters in the proposed model from the observed sequence of POI visit events, and present an analysis method for the geographical attention dynamics. Using real data of POI visit events in a Japanese sightseeing city, we demonstrate that the proposed model outperforms conventional models in terms of predictive accuracy, and uncover the spatio-temporal influence structure among major sightseeing areas in the city from the perspective of geographical attention dynamics.
Numerical Modeling of Tectonic Processes
Numerical Modeling of Tectonic Processes
Optimal stock–enhancement of a spatially distributed renewable resource
We study the economic management of a renewable resource, the stock of which is spatially distributed and moves over a discrete or continuous spatial domain. In contrast to standard harvesting models where the agent can control the take-out from the stock, we consider the case of optimal stock enhancement. In other words, we model an agent who is, either because of ecological concerns or because of economic incentives, interested in the conservation and enhancement of the abundance of the resource, and who may foster its growth by some costly stock–enhancement activity (e.g., cultivation, breeding, fertilizing, or nourishment). By investigating the optimal control problem with infinite time horizon in both spatially discrete and spatially continuous (1D and 2D) domains, we show that the optimal stock–enhancement policy may feature spatially heterogeneous (or patterned) steady states. We numerically compute the global bifurcation structure and optimal time-dependent paths to govern the system from some initial state to a patterned optimal steady state. Our findings extend the previous results on patterned optimal control to a class of ecological systems with important ecological applications, such as the optimal design of restoration areas.
Read moreSuper-resolution method for coherent DOA estimation of multiple wideband sources
We focus on coherent Direction Of Arrival (DOA) estimation of wideband sources based on spatial sparsity. By development of super-resolution algorithms, DOA estimation of narrowband sources has already been addressed based on gridless sparse algorithms and atomic norm minimization. In this paper, a super-resolution based method is proposed for coherent DOA estimation of multiple wideband sources. To do so, we first develop a new focusing method to map the subband with the largest center frequency to the other ones with no requirement for any initial estimates. Then, using the latter focusing method, we introduce an atomic norm problem by defining a new set of atoms and exploiting the signal joint sparsity of different frequency subbands in a continuous spatial domain. This problem is then cast as a semidefinite program, which leads to implementing a new coherent DOA estimation method with higher resolution and more robustness to noise. Our method only needs one single snapshot for each frequency subband, although it can also be used for multiple snapshots. Numerical simulations show the outperformance of the proposed method compared to the conventional ones.
Read moreEEG dynamical network analysis method reveals the neural signature of visual-motor coordination
Human visual-motor coordination is an essential function of movement control, which requires interactions of multiple brain regions. Understanding the cortical-motor coordination is important for improving physical therapy for motor disabilities. However, its underlying transient neural dynamics is still largely unknown. In this study, we applied an eigenvector-based dynamical network analysis method to investigate the functional connectivity calculated from electroencephalography (EEG) signals under visual-motor coordination task and to identify its meta-stable states dynamics. We first tested this signal processing on a simulated network to evaluate it in comparison with other dynamical methods, demonstrating that the eigenvector-based dynamical network analysis was able to correctly extract the dynamical features of the evolving networks. Subsequently, the eigenvector-based analysis was applied to EEG data collected under a visual-motor coordination experiment. In the EEG study with participants, the results of both topological analysis and the eigenvector-based dynamical analysis were able to distinguish different experimental conditions of visual tracking task. With the dynamical analysis, we showed that different visual-motor coordination states can be distinguished by investigating the meta-stable states dynamics of the functional connectivity.
Read moreGraph-based Point-of-interest Recommendation with Geographical and Temporal Influences
The availability of user check-in data in large volume from the rapid growing location-based social networks (LBSNs) enables a number of important location-aware services. Point-of-interest (POI) recommendation is one of such services, which is to recommend POIs that users have not visited before. It has been observed that: (i) users tend to visit nearby places, and (ii) users tend to visit different places in different time slots, and in the same time slot, users tend to periodically visit the same places. For example, users usually visit a restaurant during lunch hours, and visit a pub at night. In this paper, we focus on the problem of time-aware POI recommendation, which aims at recommending a list of POIs for a user to visit at a given time. To exploit both geographical and temporal influences in time aware POI recommendation, we propose the Geographical-Temporal influences Aware Graph (GTAG) to model check-in records, geographical influence and temporal influence. For effective and efficient recommendation based on GTAG, we develop a preference propagation algorithm named Breadth first Preference Propagation (BPP). The algorithm follows a relaxed breath-first search strategy, and returns recommendation results within at most 6 propagation steps. Our experimental results on two real-world datasets show that the proposed graph-based approach outperforms state-of-the-art POI recommendation methods substantially.
Read moreThe Analysis of the Regional Industry-University-Research Cooperative Innovation Dynamical System
The paper analyzed the regional Industry-University-Research cooperative technological innovation system from external dynamic to the inner dynamic and then analyzed the interaction of external dynamic and internal dynamic by using the dynamical analysis method. According to the specific conditions of the dynamic elements, it combined with the dynamics method, and constructed the elements relation model of the regional Industry-University-Research Cooperative technological Innovation dynamical system.
Read moreReimagining multiplication as diagrammatic and dynamic concepts via cutting, pasting and rescaling actions
<p style='text-indent:20px;'>Recently, Tisdell [<xref ref-type="bibr" rid="b48">48</xref>] developed some alternative pedagogical perspectives of multiplication strategies via cut-and-paste actions, underpinned via the principle of conservation of area. However, the ideas therein were limited to problems involving two factors that were close together, and so would not directly apply to a problem such as 17 × 93. The purpose of the present work is to establish what diagrammatic and dynamic perspectives could look like for these more complex classes of multiplication problems. My approach to explore this gap is through an analysis and discussion of case studies. I probe several multiplication problems in depth, and drill down to get at their complexity. Through this process, new techniques emerge that involve cut-and-paste and rescaling actions to enable a reimagination of the problem from diagrammatic and dynamic points of view. Furthermore, I provide some suggestions regarding how these ideas might be supplemented in the classroom through the employment of history that includes Leonardo Da Vinci's use of conservation principles in his famous notebooks. I thus establish a pedagogical framework that has the potential to support the learning and teaching of these extended problems from diagrammatic and dynamic perspectives. groups.</p>
Read moreAn algorithm for routes recommendation service based on the Radio-Frequency Identification application
Creating high quality products/services in terms of consumer preference has become a critical issue for tourism managers. To fulfil these needs, this paper proposes a route recommendation algorithm that supplies movement routes with the locations they want visit. The analysis of visiting locations and corresponding timestamps are based on a Radio-Frequency Identification (RFID) data and stored in a route database. We firstly proposed a point of interest (POI) Sequence of RFID Probability Events Mining Algorithm to generate the POI Sequence. According to the visitor's route recommendation service requirement, based on the POI Sequence, we develop a Recommendation of Route based on POI Sequence Algorithm. A simulation case is implemented to show the feasibility of the proposed Algorithm. Based on the experimental results, it is clear that the recommended route satisfies visitor requirements using previous visitor's preference.
Read moreDimensionality Reduction Analysis Method of Complex Data Based on Convolutional Neural Network
With the arrival of the era of big data, people's life has been inseparable from data. The continuous increase of data dimensions leads to the difficulty of data storage, and the difficulty of processing large-scale data becomes more complex. Therefore, how to simplify the data and extract the representative data is always a difficult problem. With the development of remote sensing technology, the images collected by new remote sensing sensors have continuous spectral domain and spatial domain, and these images contain a large amount of ground object information. Therefore, dimensionality reduction of hyperspectral image data is the main goal of this paper. The traditional remote sensing image classification framework only uses spectral domain information to classify, ignoring the influence of spatial domain information on classification. In the convolutional neural network, images can be directly input into the network without too much preprocessing and can be learned implicitly from the training data, which avoids the process of data reconstruction in feature extraction and classification. Based on this background, this paper studies the data dimensionality reduction model based on convolutional neural network.
Read moreBuilding a suicide perception scale from a dynamic point of view, on a sample of drug addicts. A field study at the Al-Waseet Center for drug addicts - in the city of Chlef
The aim of this study was to construct a scale for suicide ideation from a dynamic perspective among drug addicts, verify its psychometric properties, and then identify differences in suicide ideation between genders. The study was conducted on a sample of 45 male and female drug addicts, 39 males and 6 females, at the Al-Wasit Center for Drug Addicts in Chlef city. After collecting the study data and conducting appropriate statistical analyses, a suicide ideation scale was developed based on Karl Menninger's (dynamic) concept, with good validity and reliability, making it reliable for scientific studies and research. There were significant differences between genders in suicide ideation, favoring males.
Read moreSpatial-Temporal Value-of-Information Maximization for Mobile Crowdsensing in Wireless Sensor Networks
Mobile crowdsensing is considered as a promising technology to exploit the computing and sensing capabilities of the decentralized wireless sensor nodes. Typically, the quality of information obtained from crowdsensing is largely affected by various factors, such as the diverse requirements of crowdsensing tasks, the varying quality of information across different crowd workers, and the dynamic changes of channels conditions and the sensing environment. In this paper, considering the dynamics’ of the crowd workers, we focus on a spatial-temporal crowdsensing model and aim to maximize the value of information at the point of interest, by optimizing the recruiting range and time duration for the crowd workers. In particular, the crowdsensing system includes a mobile access point (MAP) and a set of wireless sensor nodes. As the information requester, the MAP can broadcast its crowdsensing task and then estimate the value of information by collecting the responses from the sensing nodes. Each sensing node in the crowdsensing task will receive a payment from the MAP. We aim to maximize the utility of the information requester by optimizing the recruiting range and waiting time for the sensing nodes. We firstly define a set of value metrics to characterize the MAP’s value of information. The optimal recruiting range can be obtained in closed-form expressions. Furthermore, considering the aging effect, we propose a gradient-based method to maximize the spatial-temporal value of information. Specifically, we first determine the optimal recruiting time for the requester and then choose the optimal recruiting range within each time slot. Via simulation, we first compare the sum, max, and min values of information at the requester, and then verify the effectiveness of the gradient-based method to optimize the recruiting time and range to maximize the value of information.
Read moreEfficient recovery of missing events
For various entering and transmission issues raised by human or system, missing events often occur in event data, which record execution logs of business processes. Without recovering these missing events, applications such as provenance analysis or complex event processing built upon event data are not reliable. Following the minimum change discipline in improving data quality, it is also rational to find a recovery that minimally differs from the original data. Existing recovery approaches fall short of efficiency owing to enumerating and searching over all the possible sequences of events. In this paper, we study the efficient techniques for recovering missing events. According to our theoretical results, the recovery problem is proved to be NP-hard. Nevertheless, we are able to concisely represent the space of event sequences in a branching framework. Advanced indexing and pruning techniques are developed to further improve the recovery efficiency. Our proposed efficient techniques make it possible to find top-k recoveries. The experimental results demonstrate that our minimum recovery approach achieves high accuracy, and significantly outperforms the state-of-the-art technique for up to 5 orders of magnitudes improvement in time performance.
Read moreST-PIL
Point-of-Interest (POI) recommendation is an important task in location-based social networks. It facilitates the relation modeling between users and locations. Recently, researchers recommend POIs by long- and short-term interests and achieve success. However, they fail to well capture the periodic interest. People tend to visit similar places at similar times or in similar areas. Existing models try to acquire such kind of periodicity by user's mobility status or time slot, which limits the performance of periodic interest. To this end, we propose to learn spatial-temporal periodic interest. Specifically, in the long-term module, we learn the temporal periodic interest of daily granularity, then utilize intra-level attention to form long-term interest. In the short-term module, we construct various short-term sequences to acquire the spatial-temporal periodic interest of hourly, areal, and hourly-areal granularities, respectively. Finally, we apply inter-level attention to automatically integrate multiple interests. Experiments on two real-world datasets demonstrate the state-of-the-art performance of our method.
Read moreEfficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive and fixed-time intervals in a sequence. Previous studies on serial episodes consider only frequent serial episodes in a sequence of events (called simple sequence). In real world, we may find a set of events at each time slot in terms of various intervals (called complex sequence). Mining frequent serial episodes in complex sequences has more extensive applications than that in simple sequences. In this paper, we discuss the problem on mining frequent serial episodes in a complex sequence. We extend previous algorithm MINEPI to MINEPI+ for serial episode mining from complex sequences. Furthermore, a memory-anchored algorithm called EMMA is introduced for the mining task.
Read moreDynamic behaviors analysis of fraction-order neural network under memristive electromagnetic induction
The dynamic behaviors of coupled neurons with different mathematical representations have received more and more attention in recent years. The coupling among heterogeneous neurons can show richer dynamic phenomena, which is of great significance in understanding the function of the human brain. In this paper, we present a fraction-order heterogeneous network with three neurons, which is built by coupling an FN neuron with two HR neurons. Complex electromagnetic surroundings have meaningful physical influence on the electrical activities of neurons. To imitate the effects of electromagnetic induction on the three-neuron heterogeneous network, we introduce a fraction-order locally active memristor in the neural network. The characteristics of this memristor are carefully analyzed by pinched hysteresis loops and its locally active characteristic is proved by the power-off plot and the DC <i>v-i</i> plot. Then, the parameter-dependent dynamic activities are investigated numerically by using several dynamical analysis methods, such as the phase diagrams, bifurcation diagrams, Lyapunov exponent spectra, and attraction basins. In addition, the network also reveals rich dynamic behaviors, including coexisting activities, anti-monotonicity phenomena, transient chaos and firing patterns, providing support for further investigating the firing patterns of the human brain. In particular, complex dynamics, including coexisting attractors, anti-monotonicity, and firing patterns, can be influenced by the order and strength of electrical synaptic coupling and electromagnetic induction. The control of the bistable state can be realized through the time feedback control method, so that the bistable state can be transformed into an ideal monostable state. The study of the fraction-order memristive neural network may expand the field of view for understanding the collective behaviors of neurons. Finally, based on the ARM platform, we give a digital implementation of the fraction-order memristive neural network, which can verify the consistency with the numerical simulation results. In the future, we will explore more interesting memristive neural networks and study different types of methods to control the firing behaviors of the networks.
Read more