Large-scale dynamic hydrofracturing, healing and fracture network characterization

Permeability of a rock is a dynamic property that varies spatially and temporally. Fractures provide the most efficient channels for fluid flow and thus directly contribute to the permeability of the system. Fractures usually form as a result of a combination of tectonic stresses, gravity (i.e. lithostatic pressure) and fluid pressures. High pressure gradients alone can cause fracturing, the process which is termed as hydrofracturing that can determine caprock (seal) stability or reservoir integrity. Fluids also transport mass and heat, and are responsible for the formation of veins by precipitating minerals within open fractures. Veining (healing) thus directly influences the rock’s permeability. Upon deformation these closed factures (veins) can refracture and the cycle starts again. This fracturing-healing-refacturing cycle is a fundamental part in studying the deformation dynamics and permeability evolution of rock systems. This is generally accompanied by fracture network characterization focusing on network topology that determines network connectivity. Fracture characterization allows to acquire quantitative and qualitative data on fractures and forms an important part of reservoir modeling. This thesis highlights the importance of fracture-healing and veins’ mechanical properties on the deformation dynamics. It shows that permeability varies spatially and temporally, and that healed systems (veined rocks) should not be treated as fractured systems (rocks without veins). Field observations also demonstrate the influence of contrasting mechanical properties, in addition to the complexities of vein microstructures that can form in low-porosity and permeability layered sequences. The thesis also presents graph theory as a characterization method to obtain statistical measures on evolving network connectivity. It also proposes what measures a good reservoir should have to exhibit potentially large permeability and robustness against healing. The results presented in the thesis can have applications for hydrocarbon and geothermal reservoir exploration, mining industry, underground waste disposal, CO2 injection or groundwater modeling.

Continuum tensor network field states, path integral representations and spatial symmetries

A natural way to generalize tensor network variational classes to quantum field systems is via a continuous tensor contraction. This approach is first illustrated for the class of quantum field states known as continuous matrix-product states (cMPS). As a simple example of the path-integral representation we show that the state of a dynamically evolving quantum field admits a natural representation as a cMPS. A completeness argument is also provided that shows that all states in Fock space admit a cMPS representation when the number of variational parameters tends to infinity. Beyond this, we obtain a well-behaved field limit of projected entangled-pair states (PEPS) in two dimensions that provide an abstract class of quantum field states with natural symmetries. We demonstrate how symmetries of the physical field state are encoded within the dynamics of an auxiliary field system of one dimension less. In particular, the imposition of Euclidean symmetries on the physical system requires that the auxiliary system involved in the class' definition must be Lorentz-invariant. The physical field states automatically inherit entropy area laws from the PEPS class, and are fully described by the dissipative dynamics of a lower dimensional virtual field system. Our results lie at the intersection many-body physics, quantum field theory and quantum information theory, and facilitate future exchanges of ideas and insights between these disciplines.

Credible Commitments and Post-Conflict Refugee Return: A Statistical and Network Analysis

I examine determinants of refugee return after conflicts. I argue that institutional constraints placed on the executive provide a credible commitment that signals to refugees that the conditions required for durable return will be created. This results in increased return flows for refugees. Further, when credible commitments are stronger in the country of origin than in the country of asylum, the level of return increases. Finally, I find that specific commitments made to refugees in the peace agreement do not lead to increased return because they are not credible without institutional constraints. Using data on returnees that has only recently been made available, along with network analysis and an original coding of the provisions in refugee agreements, statistical results are found to support this theory. An examination of cases in Djibouti, Sierra Leone, and Liberia provides additional support for this argument.

Semantic Mining based on graph theory and ontologies. Case Study: Cell Signaling Pathways

In this paper we use concepts from graph theory and cellular biology represented as ontologies, to carry out semantic mining tasks on signaling pathway networks. Specifically, the paper describes the semantic enrichment of signaling pathway networks. A cell signaling network describes the basic cellular activities and their interactions. The main contribution of this paper is in the signaling pathway research area, it proposes a new technique to analyze and understand how changes in these networks may affect the transmission and flow of information, which produce diseases such as cancer and diabetes. Our approach is based on three concepts from graph theory (modularity, clustering and centrality) frequently used on social networks analysis. Our approach consists into two phases: the first uses the graph theory concepts to determine the cellular groups in the network, which we will call them communities; the second uses ontologies for the semantic enrichment of the cellular communities. The measures used from the graph theory allow us to determine the set of cells that are close (for example, in a disease), and the main cells in each community. We analyze our approach in two cases: TGF-β and the Alzheimer Disease.

Relações interorganizacionais e eficiência coletiva: um estudo de caso no arranjo produtivo local de confecções do Agreste de Pernambuco

This work is a study in the Local Productive Arrangement of confections from Agreste of Pernambuco, as a relevant sector in economic and social aspect. This research has as central aim to understand how the inter-organizational relations influence the collective efficiency of arrangement. The theoretical framework employed highlights the approaches that deal with the benefits of business agglomeration for the develop­ment of firms and regions. It has discussed the approach of small and medium enter­ prises and industrial districts (SCHMITZ, 1997), which introduce the concept of col­ lective efficiency, explaining that only those externalities explained by Marshall (1996) are not sufficient to explain the competitive advantage of enterprises, expand­ing the idea that organizations achieve competitive advantage not acting alone. To examine the influences of relations in the collective efficiency, it has been taken as analytical perspective theory of social networks (GRANOVETTER, 1973, 1985; BURT, 1992; UZZI, 1997) because it has believe that this approach provides subsi­ dies for a structural analysis of social relationships in face the behavior of human ac­tion. By examining the organizations in a social network, you should understand the reason of this establishment of the relationship, their benefits, and as the information flow takes place and density of links between the actors (Powell; SMITH-DOERR, 1994). As for the methods, this study is characterized as a case study, in according to the purposed objectives, in addition to qualitative method. Also, due to recovering of the historical milestones of the arrangement, it is used a sectional approach with longitudinal perspective (VIEIRA, 2004). The primary and secondary data were used in order to understand the evolutionary process of the sector and their inter-actors re­ lationships in the arrangement for the promotion of development, for both, was used the contend and documentary analysis technique, respectively (DELLAGNELO ; SIL­VA, 2005). The approach of social networks has permitted understand that social re­lationships may extend the collective efficiency of the arrangement, and therefore need to develop policies that encourage the legalization of informal companies in ar­rangement, by showing up themselves representative. Thus, the relations estab­ lished in LPA of confections from Agreste of Pernambuco need for more effective mechanisms to broaden the collective efficiency. Therefore, this way as take place has directly benefited only a group of companies that are linked in some way the sup­portive institutions. So we can conclude that the inter-actor relations have limited the collective efficiency of LPA, being stimulated by the institutions in support only to groups of entrepreneurs, even those that produce external relations for all clustered companies

A regulação diante da evolução da essencialidade do serviço público : a reclassificação da banda larga como serviço de telecomunicações nos Estados Unidos

Dissertação (mestrado)—Universidade de Brasília, Faculdade de Direito, Programa de Pós-Graduação em Direito, 2016.

Small cluster in cyber physical systems: network topology, interdependence and cascading failures

In cyber physical system (CPS), computational resources and physical resources are strongly correlated and mutually dependent. Cascading failures occur between coupled networks, cause the system more fragile than single network. Besides widely used metric giant component, we study small cluster (small component) in interdependent networks after cascading failures occur. We first introduce an overview on how small clusters distribute in various single networks. Then we propose a percolation theory based mathematical method to study how small clusters be affected by the interdependence between two coupled networks. We prove that the upper bounds exist for both the fraction and the number of operating small clusters. Without loss of generality, we apply both synthetic network and real network data in simulation to study small clusters under different interdependence models and network topologies. The extensive simulations highlight our findings: except the giant component, considerable proportion of small clusters exists, with the remaining part fragmenting to very tiny pieces or even massive isolated single vertex; no matter how the two networks are tightly coupled, an upper bound exists for the size of small clusters. We also discover that the interdependent small-world networks generally have the highest fractions of operating small clusters. Three attack strategies are compared: Inter Degree Priority Attack, Intra Degree Priority Attack and Random Attack. We observe that the fraction of functioning small clusters keeps stable and is independent from the attack strategies.

Frontier technologies of trust computing and network security

The increasing complexity of computer systems and communication networks induces tremendous requirements for trust and security. This special issue includes topics on trusted computing, risk and reputation management, network security and survivable computer systems/networks. These issues have evolved into an active and important area of research and development. The past decade has witnessed a proliferation of concurrency and computation systems for practice of highly trust, security and privacy, which has become a key subject in determining future research and development activities in many academic and industrial branches. This special issue aims to present and discuss advances of current research and development in all aspects of trusted computing and network security. In addition, this special issue provides snapshots of contemporary academia work in the field of network trusted computing. We prepared and organized this special issue to record state-of-the-art research, novel development and trends for future insight in this domain. In this special issue, 14 papers have been accepted for publication, which demonstrate novel and original work in this field. A detailed overview of the selected works is given below.

Evolving an adaptive artificial neural network with a gravitational search algorithm

In this paper, a supervised fuzzy adaptive resonance theory neural network, i.e., Fuzzy ARTMAP (FAM), is integrated with a heuristic Gravitational Search Algorithm (GSA) that is inspired from the laws of Newtonian gravity. The proposed FAM-GSA model combines the unique features of both constituents to perform data classification. The classification performance of FAM-GSA is benchmarked against other state-of-art machine learning classifiers using an artificially generated data set and two real data sets from different domains. Comparatively, the empirical results indicate that FAM-GSA generally is able to achieve a better classification performance with a parsimonious network size, but with the expense of a higher computational load.

An incremental meta-cognitive-based scaffolding fuzzy neural network

The idea of meta-cognitive learning has enriched the landscape of evolving systems, because it emulates three fundamental aspects of human learning: what-to-learn; how-to-learn; and when-to-learn. However, existing meta-cognitive algorithms still exclude Scaffolding theory, which can realize a plug-and-play classifier. Consequently, these algorithms require laborious pre- and/or post-training processes to be carried out in addition to the main training process. This paper introduces a novel meta-cognitive algorithm termed GENERIC-Classifier (gClass), where the how-to-learn part constitutes a synergy of Scaffolding Theory - a tutoring theory that fosters the ability to sort out complex learning tasks, and Schema Theory - a learning theory of knowledge acquisition by humans. The what-to-learn aspect adopts an online active learning concept by virtue of an extended conflict and ignorance method, making gClass an incremental semi-supervised classifier, whereas the when-to-learn component makes use of the standard sample reserved strategy. A generalized version of the Takagi-Sugeno Kang (TSK) fuzzy system is devised to serve as the cognitive constituent. That is, the rule premise is underpinned by multivariate Gaussian functions, while the rule consequent employs a subset of the non-linear Chebyshev polynomial. Thorough empirical studies, confirmed by their corresponding statistical tests, have numerically validated the efficacy of gClass, which delivers better classification rates than state-of-the-art classifiers while having less complexity.

Rock slope stability analyses using extreme learning neural network and terminal steepest descent algorithm

The analysis of rock slope stability is a classical problem for geotechnical engineers. However, for practicing engineers, proper software is not usually user friendly, and additional resources capable of providing information useful for decision-making are required. This study developed a convenient tool that can provide a prompt assessment of rock slope stability. A nonlinear input-output mapping of the rock slope system was constructed using a neural network trained by an extreme learning algorithm. The training data was obtained by using finite element upper and lower bound limit analysis methods. The newly developed techniques in this study can either estimate the factor of safety for a rock slope or obtain the implicit parameters through back analyses. Back analysis parameter identification was performed using a terminal steepest descent algorithm based on the finite-time stability theory. This algorithm not only guarantees finite-time error convergence but also achieves exact zero convergence, unlike the conventional steepest descent algorithm in which the training error never reaches zero.

Network Construction and Graph Theoretical Analysis of Functional Language Networks in Pediatric Epilepsy

This dissertation introduces a new approach for assessing the effects of pediatric epilepsy on the language connectome. Two novel data-driven network construction approaches are presented. These methods rely on connecting different brain regions using either extent or intensity of language related activations as identified by independent component analysis of fMRI data. An auditory description decision task (ADDT) paradigm was used to activate the language network for 29 patients and 30 controls recruited from three major pediatric hospitals. Empirical evaluations illustrated that pediatric epilepsy can cause, or is associated with, a network efficiency reduction. Patients showed a propensity to inefficiently employ the whole brain network to perform the ADDT language task; on the contrary, controls seemed to efficiently use smaller segregated network components to achieve the same task. To explain the causes of the decreased efficiency, graph theoretical analysis was carried out. The analysis revealed no substantial global network feature differences between the patient and control groups. It also showed that for both subject groups the language network exhibited small-world characteristics; however, the patient’s extent of activation network showed a tendency towards more random networks. It was also shown that the intensity of activation network displayed ipsilateral hub reorganization on the local level. The left hemispheric hubs displayed greater centrality values for patients, whereas the right hemispheric hubs displayed greater centrality values for controls. This hub hemispheric disparity was not correlated with a right atypical language laterality found in six patients. Finally it was shown that a multi-level unsupervised clustering scheme based on self-organizing maps, a type of artificial neural network, and k-means was able to fairly and blindly separate the subjects into their respective patient or control groups. The clustering was initiated using the local nodal centrality measurements only. Compared to the extent of activation network, the intensity of activation network clustering demonstrated better precision. This outcome supports the assertion that the local centrality differences presented by the intensity of activation network can be associated with focal epilepsy.

Performance analysis of software-defined network switch using M/Geo/1 model

The aim of this letter is to propose an analytical model to study the performance of Software-Defined Network (SDN) switches. Here, SDN switch performance is defined as the time that an SDN switch needs to process packet without the interaction of controller. We exploit the capabilities of queueing theory based M/Geo/1 model to analyze the key factors, flowtable size, packet arrival rate, number of rules, and position of rules. The analytical model is validated using extensive simulations. Our study reveals that these factors have significant influence on the performance of an SDN switch.

Graph theory based QoE-driven cooperation stimulation for content dissemination in device-To-device communication

With multimedia dominating the digital contents, Device-To-Device (D2D) communication has been proposed as a promising data offloading solution in the big data area. As the quality of experience (QoE) is a major determining factor in the success of new multimedia applications, we propose a QoEdriven cooperative content dissemination (QeCS) scheme in this work. Specifically, all users predict the QoE of the potential connections characterized by the mean opinion score (MOS), and send the results to the content provider (CP). Then CP formulates a weighted directed graph according to the network topology and MOS of each potential connection. In order to stimulate cooperation among the users, the content dissemination mechanism is designed through seeking 1-factor of the weighted directed graph with the maximum weight thus achieving maximum total user MOS. Additionally, a debt mechanism is adopted to combat the cheat attacks. Furthermore, we extend the proposed QeCS scheme by considering a constrained condition to the optimization problem for fairness improvement. Extensive simulation results demonstrate that the proposed QeCS scheme achieves both efficiency and fairness especially in large scale and density networks.