Ancient Chinese Tombs: Western Han Dynasty Chapter

The study of history is one way of preserving human culture. In China, a country with thousands of years long history, a vast number of historical events have been recorded in different literary works, including history books, fictions, biographies, and so on. However, we still need evidence to support or verify those literatures. One physical evidence are antiques excavated from tombs of different dynasties. The ancient tomb mirrors a micro society of a certain dynasty. This project presented in this study is a 3D environmental design, comprised of four 3D scenes in high quality rendering to show the architecture and interior environment of an ancient tomb. Due to the long history of China (more than 3000 years), it is impossible to cover all dynasties here. Hence in this study, the author focuses on the Western Han dynasty (206BC - 9AD) because it was one of the peaks of the development of Chinese culture, and the royal mausoleums from Han spread all over the city of Taiyuan where rich cultural relics were perfectly excavated. This 3D design reproduced the ancient tomb’s architecture using softwares such as, Maya, Zbrush and Substance Painter. The author created 3 important rooms including the chariot room, the front room and the main room. In each room, specific lighting, different decoration and beautiful burial objects were created and carefully added to restore an incredibly lifelike 3D ancient tomb. This 3D design can easily attract people’s attention and help audience understand this ancient cultural relics that were extensively destroyed by now

The Membership Relation in Fuzzy Operators

Firstly the membership relation in fuzzy operators located outside Zadeh operators be discussed and given. Secondly the membership relation in fuzzy operators located within Zadeh operators be discussed and given

Relation Equations in the Set of Finite Natural Numbers and Its Strunk of Solutions

Definition of relation equations Quv◦Xvw=Suw in the set of finite natural numbers is given. Based on the discovery of the maximum solution of relation equations Quv◦Xvw=Suw in the set of finite natural numbers, the strunk of solutions of relation equations Quv◦Xvw=Suw in the set of finite natural numbers is provided

Relation Equations in the Set of Finite Natural Numbers and Its Maximal Solution

Definition of relation equations Quv◦Xvw=Suw in the set of finite natural numbers is given. Rapid method of solving the maximal solution of relation equations Quv◦Xvw=Suw in the set of finite natural numbers is provided

nn-body Correlation of Tonks-Girardeau Gas

For the well-known exponential complexity it is a giant challenge to calculate the correlation function for general many-body wave function. We investigate the ground state $n$th-order correlation functions of the Tonks-Girardeau (TG) gases. Basing on the wavefunction of free fermions and Bose-Fermi mapping method we obtain the exact ground state wavefunction of TG gases. Utilizing the properties of Vandermonde determinant and Toeplitz matrix, the $n$th-order correlation function is formulated as $(N-n)$-order Toeplitz determinant, whose element is the integral dependent on 2$(N-n)$ sign functions and can be computed analytically. By reducing the integral on domain $[0,2\pi]$ into the summation of the integral on several independent domains, we obtain the explicit form of the Toeplitz matrix element ultimately. As the applications we deduce the concise formula of the reduced two-body density matrix and discuss its properties. The corresponding natural orbitals and their occupation distribution are plotted. Furthermore, we give a concise formula of the reduced three-body density matrix and discuss its properties. It is shown that in the successive second measurements, atoms appear in the regions where atoms populate with the maximum probability in the first measurement.Comment: 8 pages, 7 figure

Programación del prototipo de un robot clasificador

En la actualidad el uso de robots está cada vez más presente en la vida cotidiana, desde robots de uso habitual para tareas domésticas (por ejemplo Roomba Vacuum Cleaning) hasta robots industriales que realizan tareas complejas o repetitivas sustituyendo el trabajo humano y además están apareciendo robots humanoides que ayudan a las personas dependientes. En el presente artículo se presenta un caso real de la programación de un robot autónomo; desde el ensamblado hardware hasta la automatización a través del software ROS (Robot Operating System).Nowadays the use of robots is constantly increasing in our daily life, not only for household work, but also for industrial field to perform complex or recurring tasks easing the human labour. Moreover, humanoid robots are developed to help dependant people. In this article, a real autonomous robot programming case will be seen; beginning by the hardware assembly and ending by the automation through ROS (Robot Operating System).En l'actualitat l'ús de robots està cada vegada més present en la vida quotidiana, des de robots d'ús habitual per a tasques domèstiques (per exemple Roomba Vacuum Cleaning) fins robots industrials que realitzen tasques complexes o repetitives substituint el treball humà i a més estan apareixent robots humanoides que ajuden a les persones dependents. En el present article es presenta un cas real de la programació d'un robot autònom; des de l'acoblament maquinari fins l'automatització mitjançant el programari ROS (Robot Operating System)

A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming

Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation and yields a quadratic objective function with simple quadratic constraints. A feasible direction algorithm is used to solve the nonlinear programming. The convergent analysis and time complexity of the method is given. Coupled with randomized algorithm, a suboptimal solution is obtained for the binary quadratic programming. At last, we report some numerical examples to compare our algorithm with randomized algorithm based on the interior point method and the feasible direction algorithm on max-cut problem. Simulation results have shown that our method is faster than the other two methods

A Method to Get the General Solutions of Linear Differential Equation or Equations with Constant Coefficients Based on Laplace Transformation

In management science research, a large number of cases analysis often requier from qualitative analysis to quantitative analysis, differential equation and differential equations are often used in quantitative analysis. The core of quantitative analysis of a case is to build a corresponding mathematical model. The differential equation models are widely used mathematical models. In particular, linear differential equation models with constant coefficients are often used mathematical models in the quantitative analysis of cases in management science research. In practice, the particular solution of linear differential equation model with constant coefficients often been found by Laplace transformation. Follow this way, a method to get the general solutions of linear differential equation with constant coefficients based on Laplace transformation be given. In this method, it is easy to find the general solution of homogeneous linear differential equation, of non-homogeneous linear differential equation and of linear differential equations with constant coefficients based on Laplace transformation.Key words: Management; Mathematical model; Linear differential equation; Laplace transformatio