Driver Countries in Global Banking Network

We analyze the network of cross-border bank lending connections among countries from 1977 to 2018. The network includes core countries that lend money and peripheral countries that borrow money from core countries. In nowadays highly connected banking network, financial crisis that start from a country can spread to other countries very fast and cause global affects. We use principal component analysis (PCA) to find the influential lending (core) countries in this network over the years and clusters of borrowing (peripheral) countries related to these impactful core countries. We find three clusters of peripheral countries, with some constant and some changing members over time. This can be a sign of changes in the financial or political interactions among countries. The changes in the role of core countries and how these roles get affected by the important financial crisis in the past decades is investigated. Among 31 of core countries, 7 countries have a partially or constantly important role in the network including France, United Kingdom, United States, Japan, Germany, Chinese Taipei and Switzerland.     

Energy Based Logic Mining Analysis with Hopfield Neural Network for Recruitment Evaluation

An effective recruitment evaluation plays an important role in the success of companies, industries and institutions. In order to obtain insight on the relationship between factors contributing to systematic recruitment, the artificial neural network and logic mining approach can be adopted as a data extraction model. In this work, an energy based k satisfiability reverse analysis incorporating a Hopfield neural network is proposed to extract the relationship between the factors in an electronic (E) recruitment data set. The attributes of E recruitment data set are represented in the form of k satisfiability logical representation. We proposed the logical representation to 2-satisfiability and 3-satisfiability representation, which are regarded as a systematic logical representation. The E recruitment data set is obtained from an insurance agency in Malaysia, with the aim of extracting the relationship of dominant attributes that contribute to positive recruitment among the potential candidates. Thus, our approach is evaluated according to correctness, robustness and accuracy of the induced logic obtained, corresponding to the E recruitment data. According to the experimental simulations with different number of neurons, the findings indicated the effectiveness and robustness of energy based k satisfiability reverse analysis with Hopfield neural network in extracting the dominant attributes toward positive recruitment in the insurance agency in Malaysia.     

Modeling innovation by a kinetic description of the patent citation system

This paper reports results of a network theory approach to the study of the United States patent system. We model the patent citation network as a discrete time, discrete space stochastic dynamic system. From patent data we extract an attractiveness function, A(k,l)$A(k,l)$, which determines the likelihood that a patent will be cited. A(k,l)$A(k,l)$ shows power law aging and preferential attachment. The exponent of the latter is increasing since 1993, suggesting that patent citations are increasingly concentrated on a relatively small number of patents. In particular, our results appear consistent with an increasing patent “thicket”, in which more and more patents are issued on minor technical advances.     

Clusters or networks of economies? A macroeconomy study through Gross Domestic Product

We study correlations between web-downloaded gross domestic product (GDP)'s of rich countries. GDP is used as wealth signatures of the country economical state. We calculate the yearly fluctuations of the GDP. We look for forward and backward correlations between such fluctuations. The correlation measure is based on the Theil index. The system is represented by an evolving weighted network, nodes being the GDP fluctuations (or countries) at different times.In order to extract structures from the network, we focus on filtering the time delayed correlations by removing the least correlated links. This percolation idea-based method reveals the emergence of connections, that are visualized by a branching representation. Note that the network is made of weighted and directed links when taking into account a delay time. Such a measure of collective habits does not readily fit the usual expectations, except if an economy globalization framework is accepted.     

A directed network of Greek and Roman mythology

We construct a directed network using a dictionary of Greek and Roman mythology in which the nodes represent the entries listed in the dictionary and we make directional links from an entry to other entries that appear in its explanatory part. We find that this network is clearly not a random network but a directed scale-free network in which the distributions of out-degree and in-degree follow a power-law with exponents γ_out≈3.0 and γ_in≈2.5, respectively. Also we measure several quantities which describe the topological properties of the network and compare it to that of other real networks.     

Dynamical supersymmetry breaking and gauge anomalies

Some aspects of supersymmetric gauge theories and discussed. It is shown that dynamical supersymmetry breaking does not occur in supersymmetric QED in higher dimensions. The cancellation of both local (perturbative) and global (non-perturbative) gauge anomalies are also discussed in supersymmetric gauge theories. We argue that there is no dynamical supersymmetry breaking in higher dimensions in any supersymmetric gauge theories free of gauge anomalies. It is also shown that for supersymmetric gauge theories in higher dimensions with a compact connected simple gauge group, when the local anomaly-free condition is satisfied, there can be at most a possibleZ ₂ global gauge anomaly in extended supersymmetricSO(10) (or spin (10)) gauge theories inD=10 dimensions containing additional Weyl fermions in a spinor representation ofSO(10) (or spin (10)). In four dimensions with local anomaly-free condition satisfied, the only possible global gauge anomalies in supersymmetric gauge theories areZ ₂ global gauge anomalies for extended supersymmetricSP(2N) (N=rank) gauge theories containing additional Weyl fermions in a representation ofSP(2N) with an odd 2nd-order Dynkin index.     

Patent citation network in nanotechnology (1976–2004)

The patent citation networks are described using critical node, core network, and network topological analysis. The main objective is understanding of the knowledge transfer processes between technical fields, institutions and countries. This includes identifying key influential players and subfields, the knowledge transfer patterns among them, and the overall knowledge transfer efficiency. The proposed framework is applied to the field of nanoscale science and engineering (NSE), including the citation networks of patent documents, submitting institutions, technology fields, and countries. The NSE patents were identified by keywords “full-text” searching of patents at the United States Patent and Trademark Office (USPTO). The analysis shows that the United States is the most important citation center in NSE research. The institution citation network illustrates a more efficient knowledge transfer between institutions than a random network. The country citation network displays a knowledge transfer capability as efficient as a random network. The technology field citation network and the patent document citation network exhibit a␣less efficient knowledge diffusion capability than a random network. All four citation networks show a tendency to form local citation clusters.     

Information Hiding in the DICOM Message Service and Upper Layer Service with Entropy-Based Detection

The DICOM (Digital Imaging and COmmunication in Medicine) standard provides a framework for a diagnostically-accurate representation, processing, transfer, storage and display of medical imaging data. Information hiding in DICOM is currently limited to the application of digital media steganography and watermarking techniques on the media parts of DICOM files, as well as text steganographic techniques for embedding information in metadata of DICOM files. To improve the overall security of the DICOM standard, we investigate its susceptibility to network steganographic techniques. To this aim, we develop several network covert channels that can be created by using a specific transport mechanism – the DICOM Message Service and Upper Layer Service. The bandwidth, undetectability and robustness of the proposed covert channels are evaluated, and potential countermeasures are suggested. Moreover, a detection mechanism leveraging entropy-based metrics is introduced and its performance has been assessed.     

A network of two-Chinese-character compound words in the Japanese language

Some statistical properties of a network of two-Chinese-character compound words in the Japanese language are reported. In this network, a node represents a Chinese character and an edge represents a two-Chinese-character compound word. It is found that this network has properties of being “small-world” and “scale-free”. A network formed by only Chinese characters for common use (joyo-kanji in Japanese), which is regarded as a subclass of the original network, also has the small-world property. However, a degree distribution of the network exhibits no clear power law. In order to reproduce the disappearance of the power-law property, a model for a selecting process of the Chinese characters for common use is proposed.     

Empirical analysis of the worldwide maritime transportation network

In this paper we present an empirical study of the worldwide maritime transportation network (WMN) in which the nodes are ports and links are container liners connecting the ports. Using the different representations of network topology — the spaces L and P, we study the statistical properties of WMN including degree distribution, degree correlations, weight distribution, strength distribution, average shortest path length, line length distribution and centrality measures. We find that WMN is a small-world network with power law behavior. Important nodes are identified based on different centrality measures. Through analyzing weighted clustering coefficient and weighted average nearest neighbors degree, we reveal the hierarchy structure and rich-club phenomenon in the network.     

On a microscopic representation of space-time

We start from a noncompact Lie algebra isomorphic to the Dirac algebra and relate this Lie algebra in a brief review to low-energy hadron physics described by the compact group SU(4). This step permits an overall physical identification of the operator actions. Then we discuss the geometrical origin of this noncompact Lie algebra and ??reduce?? the geometry in order to introduce in each of these steps coordinate definitions which can be related to an algebraic representation in terms of the spontaneous symmetry breakdown along the Lie algebra chain su*(4) ?? usp(4) ?? su(2) × u(1). Standard techniques of Lie algebra decomposition(s) as well as the (physical) operator identification give rise to interesting physical aspects and lead to a rank-1 Riemannian space which provides an analytic representation and leads to a 5-dimensional hyperbolic space H ₅ with SO(5, 1) isometries. The action of the (compact) symplectic group decomposes this (globally) hyperbolic space into H ₂ ?? H ₃ with SO(2, 1) and SO(3, 1) isometries, respectively, which we relate to electromagnetic (dynamically broken SU(2) isospin) and Lorentz transformations. Last not least, we attribute this symmetry pattern to the algebraic representation of a projective geometry over the division algebra H and subsequent coordinate restrictions.     

Tensor representation in teleportation and controlled teleportation

We propose the tensor representation of teleportation and controlled teleportation. By using this representation, it is easy to describe the process of teleporting an unknown N-qubit state via a genuine 2N-qubit channel, and to find the necessary and sufficient condition of realizing a successful teleportation (which is determined by the measurement matrix T^α and the quantum channel parameter matrix X). For controlled teleportation, if composing tensor representation with graph, one can easily design any kind of controlled teleportation. As examples, we give a scheme of symmetrically controlled teleportation of two-qubit states and a scheme of representative network controlled of three-qubit states. This method can also be generalized to the controlled teleportation of N-qubit states.     

Skeletal mechanism generation and analysis for n-heptane with CSP

We use a procedure based on the decomposition into fast and slow dynamical components offered by the Computational Singular Perturbation (CSP) method to generate automatically skeletal kinetic mechanisms for the simplification of the kinetics of n-heptane oxidation. The detailed mechanism of the n-heptane oxidation here considered has been proposed by Curran et al. and involves 561 species and 2538 reactions. After carrying out a critical assessment of important aspects of this procedure, we show that the comprehensive skeletal kinetic mechanisms so generated are able to reproduce the main features of n-heptane ignition at various initial pressures and temperatures and equivalence ratios. A by-product of the algorithm that generates the skeletal mechanisms is the identification of the network of important species and reactions at a given state of the kinetic system. The analysis of this network is carried out by resorting to a visual representation of the pathways at selected time instants of the ignition process. Visual inspection of the pathways enables the identification and comparison of the relevant kinetic processes as obtained at different ignition regimes. The graphs are generated by interfacing the model reduction procedure with the open-source package graphviz.     

Network topology and correlation features affiliated with European airline companies

The physics information of four specific airline flight networks in European Continent, namely the Austrian airline, the British airline, the France-Holland airline and the Lufthhansa airline, was quantitatively analyzed by the concepts of a complex network. It displays some features of small-world networks, namely a large clustering coefficient and small average shortest-path length for these specific airline networks. The degree distributions for the small degree branch reveal power law behavior with an exponent value of 2-3 for the Austrian and the British flight networks, and that of 1-2 for the France-Holland and the Lufthhansa airline flight networks. So the studied four airlines are sorted into two classes according to the topology structure. Similarly, the flight weight distributions show two kinds of different decay behavior with the flight weight: one for the Austrian and the British airlines and another for the France-Holland airline and the Lufthhansa airlines. In addition, the degree-degree correlation analysis shows that the network has disassortative behavior for all the value of degree k, and this phenomenon is different from the international airline network and US airline network. Analysis of the clustering coefficient (C(k)) versus k, indicates that the flight networks of the Austrian Airline and the British Airline reveal a hierarchical organization for all airports, however, the France-Holland Airline and the Lufthhansa Airline show a hierarchical organization mostly for larger airports. The correlation of node strength (S(k)) and degree is also analyzed, and a power-law fit S(k)∼k^1.1 can roughly fit all data of these four airline companies. Furthermore, we mention seasonal changes and holidays may cause the flight network to form a different topology. An example of the Austrian Airline during Christmas was studied and analyzed.     

The effect of TTL on the information traffic

In real communication protocols, the information packets have a finite Time-to-Live (TTL) to avoid the waste of network resources, such as infinite loop induced by routing error or too long transferring time. In this paper, we introduce TTL into the information traffic model on Barabási-Albert scale-free networks under local routing strategy and focus on its effect on the network capacity measured by the critical point (R_c) of phase transition from free flow to congestion. Simulations show that the network capacity and the communication velocity are improved. However, some packets are dropped before they arrived at destinations. It is found that the share of successfully arrived packets monotonously increases with the increment of TTL and it is considerably acceptable if TTL is not very small. We also examine the effect of TTL on the positive-feedback preference (PFP) internet model and the results are alike. Our work may be helpful in quantifying the effect of packet lifetime in real communication networks and in routing strategy designing.     

Prisoner’s Dilemma Game with Cooperation-Defection Dominance Strategies on Correlational Multilayer Networks

As multilayer networks are widely applied in modern society, numerous studies have shown the impact of a multilayer network structure and the network nature on the proportion of cooperators in the network. In this paper, we use Barabási–Albert scale-free networks (BA) and Watts and Strogatz networks (WS) to build a multilayer network structure, and we propose a new strategy-updating rule called “cooperation-defection dominance”, which can be likened to dominant and recessive traits in biogenetics. With the newly constructed multilayer network structure and the strategy-updating rules, based on the simulation results, we find that in the BA-BA network, the cooperation dominance strategy can make the networks with different rs show a cooperative trend, while the defection dominance strategy only has an obvious effect on the network cooperation with a larger r. When the BA network is connected to the WS network, we find that the effect of strategy on the proportion of cooperators in the network decreases, and the main influencing factor is the structure of the network. In the three-layer network, the cooperation dominance strategy has a greater impact on the BA network, and the proportion of the cooperators is enhanced more than under the natural evolution strategy, but the promotion effect is still smaller than that of the two-layer BA network because of the WS network. Under the defection dominance strategy, the WS layer appears different from the first two strategies, and we conclude through simulation that when the payoff parameter is at the middle level, its cooperator proportion will be suppressed, and we deduce that the proportion of cooperators and defectors, as well as the payoff, play an important role.     

On the second-order virial coefficient and the relationships between quantum and classical statistics and scattering

We clarify some aspects of the relationship between quantum statistical mechanics and scattering theory, which show up in their simplest form in the behaviour of the second-order virial coefficient b₂. For this purpose we derive a new representation for b₂. The relationship with classical statistical mechanics is also illuminated by a recently obtained formula for the difference between the classical and quantum second order virial coefficients which allows the determination of the leading quantum correction to b₂. The several approaches represent alternative ways of implementing the cancellation of divergences in b₂.     

On a hydrodynamical description of the Dirac equation

A new form of the Dirac equation in curved spacetime (M, g) is given. It is based on the representation of a bispinor by means of an orthonormal vierbein e_α and a complex number ?. In the geometrical language the Dirac equation obtained this way is equivalent to the system of second order equations for the vierbein. The function ? is uniquely determined by the vierbein field.     

On a Classical Limit of <Emphasis Type="Italic">q</Emphasis>-Deformed Whittaker Functions

Previously, we derive a representation of q-deformed \({\mathfrak{gl}_{\ell+1}}\) -Whittaker function as a sum over Gelfand–Zetlin patterns. This representation provides an analog of the Shintani–Casselman–Shalika formula for q-deformed \({\mathfrak{gl}_{\ell+1}}\) -Whittaker functions. In this note, we provide a derivation of the Givental integral representation of the classical \({\mathfrak{gl}_{\ell+1}}\) -Whittaker function as a limit q → 1 of the sum over the Gelfand–Zetlin patterns representation of the q-deformed \({\mathfrak{gl}_{\ell+1}}\) -Whittaker function. Thus, Givental representation provides an analog the Shintani–Casselman–Shalika formula for classical Whittaker functions.     

Analytic representation of the six-point function and inclusive processes

A new representation is proposed for the N-point retarded function defined as the Fourier transform of the matrix element between incoming states of the R product of two operators. Locality, crossing and normal cut structure in the invariant variables containing the Fourier vector are correctly incorporated in this representation and an explicit expression for the spectral function can be given. The case N = 6 is discussed in detail and structure functions for deep inelastic as well as purely hadronic inclusive processes are obtained from the representation.