An empirical study of Chinese language networks

Chinese is spoken by the largest number of people in the world, and it is regarded as one of the most important languages. In this paper, we explore the statistical properties of Chinese language networks (CLNs) within the framework of complex network theory. Based on one of the largest Chinese corpora, i.e. People’s Daily Corpus, we construct two networks (CLN1 and CLN2) from two different respects, with Chinese words as nodes. In CLN1, a link between two nodes exists if they appear next to each other in at least one sentence; in CLN2, a link represents that two nodes appear simultaneously in a sentence. We show that both networks exhibit small-world effect, scale-free structure, hierarchical organization and disassortative mixing. These results indicate that in many topological aspects Chinese language shapes complex networks with organizing principles similar to other previously studied language systems, which shows that different languages may have some common characteristics in their evolution processes. We believe that our research may shed some new light into the Chinese language and find some potentially significant implications.     

Projective market model approach to AHP decision making

In this paper, we describe market in the projective geometry language and give the definition of a matrix of market rate, which is related to the matrix rate of return and the matrix of judgements in the Analytic Hierarchy Process (AHP). We use these observations to extend the AHP model to the projective geometry formalism and generalise it to an intransitive case. We give financial interpretations of such a generalised model and propose its simplification. The unification of the AHP model and projective aspect of portfolio theory suggests a wide spectrum of new applications for such an extended model.     

English and Chinese languages as weighted complex networks

In this paper, we analyze statistical properties of English and Chinese written human language within the framework of weighted complex networks. The two language networks are based on an English novel and a Chinese biography, respectively, and both of the networks are constructed in the same way. By comparing the intensity and density of connections between the two networks, we find that high weight connections in Chinese language networks prevail more than those in English language networks. Furthermore, some of the topological and weighted quantities are compared. The results display some differences in the structural organizations between the two language networks. These observations indicate that the two languages may have different linguistic mechanisms and different combinatorial natures.     

Boundary effects in a three-state modified voter model for languages

The standard three-state voter model is extended by including the outside pressure favouring one of the three language choices and by adding some biased internal noise. The Monte Carlo simulations are motivated by states with the population divided into three groups of various affinities to each other. We show the crucial influence of the boundaries for moderate lattice sizes like 500×500. By removing the fixed boundary at one side, we demonstrate that this can lead to the victory of one single choice. Noise in contrast stabilizes the choices of all three populations. In addition, we compute the persistence probability, i.e., the number of sites who have never changed their opinion during the simulation, and we consider the case of “rigid-minded” decision makers.     

Multi-directed Eulerian growing networks

We introduce and analyze a model of a multi-directed Eulerian network, that is a directed and weighted network where a path exists that passes through all the edges of the network once and only once. Networks of this type can be used to describe information networks such as human language or DNA chains. We are able to calculate the strength and degree distribution in this network and find that they both exhibit a power law with an exponent between 2 and 3. We then analyze the behavior of the accelerated version of the model and find that the strength distribution has a double slope power-law behavior. Finally we introduce a non-Eulerian version of the model and find that the statistical topological properties remain unchanged. Our analytical results are compared with numerical simulations.     

Deconfined criticality, runaway flow in the two-component scalar electrodynamics and weak first-order superfluid-solid transitions

We perform a comparative Monte Carlo study of the easy-plane deconfined critical point (DCP) action and its short-range counterpart to reveal close similarities between the two models for intermediate and strong coupling regimes. For weak coupling, the structure of the phase diagram depends on the interaction range: while the short-range model features a tricritical point and a continuous U(1) × U(1) transition, the long-range DCP action is characterized by the runaway renormalization flow of coupling into a first (I) order phase transition. We develop a “numerical flowgram” method for high precision studies of the runaway effect, weakly I-order transitions, and polycritical points. We prove that the easy-plane DCP action is the field theory of a weakly I-order phase transition between the valence bond solid and the easy-plane antiferromagnet (or superfluid, in particle language) for any value of the weak coupling strength. Our analysis also solves the long standing problem of what is the ultimate fate of the runaway flow to strong coupling in the theory of scalar electrodynamics in three dimensions with U(1) × U(1) symmetry of quartic interactions.     

Comparison of co-occurrence networks of the Chinese and English languages

Co-occurrence networks of Chinese characters and words, and of English words, are constructed from collections of Chinese and English articles, respectively. Four types of collections are considered, namely, essays, novels, popular science articles, and news reports. Statistical parameters of the networks are studied, including diameter, average degree, degree distribution, clustering coefficient, average shortest path length, as well as the number of connected subnetworks. It is found that the character and word networks of each type of article in the Chinese language, and the word network of each type of article in the English language all exhibit scale-free and small-world features. The statistical parameters of these co-occurrence networks are compared within the same language and across the two languages. This study reveals some commonalities and differences between Chinese and English languages, and among the four types of articles in each language from a complex network perspective. In particular, it is shown that expressions in English are briefer than those in Chinese in a certain sense.     

X-ray edge spectra — a sea-boson perspective

The well-studied X-ray-edge problem is revisited using the sea-boson method. This approach is contrasted with the well-known theories of Mahan, Nozières and De Dominicis (MND). The present approach does not use the sudden approximation and the holes carry a momentum label unlike in the MND theory. We focus on the case of doped semiconductors rather than metals. The problem of electrons in a partially filled conduction band and holes in the initially hole-depleted valence band is recast in the sea-boson language. The resulting hamiltonian is shown to be equivalent to the electron-phonon hamiltonian with the excitons taking on the role of electrons and intra-conduction band particle-hole excitations known as ‘conductrons’ taking on the role of phonons. It is shown that the excitonic pole in the computed absorption spectra is replaced by a branch cut with a simple radical leading to a broadening of the exicton line due to these many-body effects. A critical comparison is made with the MND theory as well as with relevant experiments.     

Statistical keyword detection in literary corpora

Understanding the complexity of human language requires an appropriate analysis of the statistical distribution of words in texts. We consider the information retrieval problem of detecting and ranking the relevant words of a text by means of statistical information referring to the spatial use of the words. Shannon's entropy of information is used as a tool for automatic keyword extraction. By using The Origin of Species by Charles Darwin as a representative text sample, we show the performance of our detector and compare it with another proposals in the literature. The random shuffled text receives special attention as a tool for calibrating the ranking indices.     

Approaching human language with complex networks

The interest in modeling and analyzing human language with complex networks is on the rise in recent years and a considerable body of research in this area has already been accumulated. We survey three major lines of linguistic research from the complex network approach: 1) characterization of human language as a multi-level system with complex network analysis; 2) linguistic typological research with the application of linguistic networks and their quantitative measures; and 3) relationships between the system-level complexity of human language (determined by the topology of linguistic networks) and microscopic linguistic (e.g., syntactic) features (as the traditional concern of linguistics). We show that the models and quantitative tools of complex networks, when exploited properly, can constitute an operational methodology for linguistic inquiry, which contributes to the understanding of human language and the development of linguistics. We conclude our review with suggestions for future linguistic research from the complex network approach: 1) relationships between the system-level complexity of human language and microscopic linguistic features; 2) expansion of research scope from the global properties to other levels of granularity of linguistic networks; and 3) combination of linguistic network analysis with other quantitative studies of language (such as quantitative linguistics).     

Coherent presentation of density operator of the harmonic oscillator in thermostat

Based on basis of the coherent states the density matrix of harmonic oscillator in thermostat is obtained. This method is mathematically refined and physically transparent for the interpretation of quantum phenomena in classical language. Such an approach gives an opportunity to easily find the density matrix in the multi-dimensional case.     

利用ASP．NET实现物理实验数据处理

利用ASP．NET语言编制了一个物理实验数据处理系统。该系统界面友好,通过最小二乘法能够自动处理输入的实验数据,拟合出曲线,分析误差,输出曲线图形,适合在实验教学中使用。     

基于MATLAB的色谱分析初级专家系统的设计

MATLAB是 Mathworks公司推出的适用于科学和工程计算的数学软件系统 ,可高效地解决数值线性代数、微分方程数值解、数值逼近、最优化、数值积分等科学和工程问题 ,且具有可视化图形处理、使用方便、开放式多功能于一体的新一代计算机语言。文中讨论了利用 MATLAB开放式可扩充体系结构 ,开发出色谱分析综合性计算机初级专家系统的构想和设计思想。     

Power-law regularities in human language

Complex structure of human language enables us to exchange very complicated information. This communication system obeys some common nonlinear statistical regularities. We investigate four important long-range features of human language. We perform our calculations for adopted works of seven famous litterateurs. Zipf’s law and Heaps’ law, which imply well-known power-law behaviors, are established in human language, showing a qualitative inverse relation with each other. Furthermore, the informational content associated with the words ordering, is measured by using an entropic metric. We also calculate fractal dimension of words in the text by using box counting method. The fractal dimension of each word, that is a positive value less than or equal to one, exhibits its spatial distribution in the text. Generally, we can claim that the Human language follows the mentioned power-law regularities. Power-law relations imply the existence of long-range correlations between the word types, to convey an especial idea.     

Evaporation of microscopic black holes in string theory and the bound on species

We address the question how string compactifications with D‐branes are consistent with the black hole bound, which arises in any theory with number of particle species to which the black holes can evaporate. For the Kaluza‐Klein particles, both longitudinal and transversal to the D‐branes, it is relatively easy to see that the black hole bound is saturated, and the geometric relations can be understood in the language of species‐counting. We next address the question of the black hole evaporation into the higher string states and discover, that contrary to the naive intuition, the exponentially growing number of Regge states does not preclude the existence of semi‐classical black holes of sub‐stringy size. Our analysis indicates that the effective number of string resonances to which such micro black holes evaporate is not exponentially large but is bounded by N = 1/g_s², which suggests the interpretation of the well‐known relation between the Planck and string scales as the saturation of the black hole bound on the species number. In addition, we also discuss some other issues in D‐brane compactifications with a low string scale of order TeV, such as the masses of light moduli fields.     

A symmetry principle for topological quantum order

We present a unifying framework to study physical systems which exhibit topological quantum order (TQO). The major guiding principle behind our approach is that of symmetries and entanglement. These symmetries may be actual symmetries of the Hamiltonian characterizing the system, or emergent symmetries. To this end, we introduce the concept of low-dimensional Gauge-like symmetries (GLSs), and the physical conservation laws (including topological terms, fractionalization, and the absence of quasi-particle excitations) which emerge from them. We prove then sufficient conditions for TQO at both zero and finite temperatures. The physical engine for TQO are topological defects associated with the restoration of GLSs. These defects propagate freely through the system and enforce TQO. Our results are strongest for gapped systems with continuous GLSs. At zero temperature, selection rules associated with the GLSs enable us to systematically construct general states with TQO; these selection rules do not rely on the existence of a finite gap between the ground states to all other excited states. Indices associated with these symmetries correspond to different topological sectors. All currently known examples of TQO display GLSs. Other systems exhibiting such symmetries include Hamiltonians depicting orbital-dependent spin-exchange and Jahn-Teller effects in transition metal orbital compounds, short-range frustrated Klein spin models, and p+ip superconducting arrays. The symmetry based framework discussed herein allows us to go beyond standard topological field theories and systematically engineer new physical models with finite temperature TQO (both Abelian and non-Abelian). Furthermore, we analyze the insufficiency of entanglement entropy (we introduce SU(N) Klein models on small world networks to make the argument even sharper), spectral structures, maximal string correlators, and fractionalization in establishing TQO. We show that Kitaev’s Toric code model and Wen’s plaquette model are equivalent and reduce, by a duality mapping, to an Ising chain, demonstrating that despite the spectral gap in these systems the toric operator expectation values may vanish once thermal fluctuations are present. This illustrates the fact that the quantum states themselves in a particular (operator language) representation encode TQO and that the duality mappings, being non-local in the original representation, disentangle the order. We present a general algorithm for the construction of long-range string and brane orders in general systems with entangled ground states; this algorithm relies on general ground states selection rules and becomes of the broadest applicability in gapped systems in arbitrary dimensions. We exactly recast some known non-local string correlators in terms of local correlation functions. We discuss relations to problems in graph theory.     

A compact program code for simulations of quantum algorithms in classical computers

A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.     

Modelling language evolution: Examples and predictions

We survey recent computer modelling research of language evolution, focusing on a rule-based model simulating the lexicon–syntax coevolution and an equation-based model quantifying the language competition dynamics. We discuss four predictions of these models: (a) correlation between domain-general abilities (e.g. sequential learning) and language-specific mechanisms (e.g. word order processing); (b) coevolution of language and relevant competences (e.g. joint attention); (c) effects of cultural transmission and social structure on linguistic understandability; and (d) commonalities between linguistic, biological, and physical phenomena. All these contribute significantly to our understanding of the evolutions of language structures, individual learning mechanisms, and relevant biological and socio-cultural factors. We conclude the survey by highlighting three future directions of modelling studies of language evolution: (a) adopting experimental approaches for model evaluation; (b) consolidating empirical foundations of models; and (c) multi-disciplinary collaboration among modelling, linguistics, and other relevant disciplines.     

The “arch” of simulating quantum spin systems with trapped ions

We cannot translate quantum behavior arising with superposition states or entanglement efficiently into the classical language of conventional computers  (Feynman et al. in Int. J. Theor. Phys. 21:467, 1982). A universal quantum computer could describe and help to understand complex quantum systems. But it is envisioned to become functional only within the next decade(s). A shortcut was proposed via simulating the quantum behavior of interest in another quantum system, where all relevant parameters and interactions can be controlled and observables of interest detected sufficiently well. For example simulating quantum spin systems within an architecture of trapped ions (Porras and Cirac in Phys. Rev. Lett. 92:207901, 2004). Here we specify how we simulate the spin and all necessary interactions and how we calibrate their amplitudes. For example via a two-ion phase-gate operation on two axial motional modes simultaneously at a fidelity exceeding 95%. We explain the complete mode of operation of a quantum simulator on the basis of our simple model case—the proof of principle experiment of simulating the transition of a quantum magnet from paramagnetic into entangled ferromagnetic order  (Friedenauer et al. in Nat. Phys. 4:757, 2008) and emphasize some of the similarities and differences with a quantum computer.