必威(betway·官方网站)西汉姆联-EURO CUP

Online System

Reviewer Login

Editor Login

Author Login

Download

Statement of Competing Interests

Authors Contribution Form

Online Journal

Advanced search

Special subject

Current Issue

Previous Issue

Introduction

Bimonthly, started in 1957
Administrator
Shanxi Provincial Education Department
Sponsor
Taiyuan University of Technology
Publisher
Ed. Office of Journal of TYUT
Editor-in-Chief
SUN Hongbin
ISSN: 1007-9432
CN: 14-1220/N

Links

Shanxi Provincial Education Department

Taiyuan University of Technology

location： home> 2017,48(01)

Study on Three-Dimensional Concrete Model with Random Aggregate Based on Delaunay Triangulation Algorithm

This paper generates a three dimensional random aggregate model with the dual relationship between Delaunay triangulation graph and Voronoi diagram. The Delaunay triangulation algorithm in 2-D is spread to 3-D with programming language and ANSYS. In order to verify the effectiveness of the proposed model and analysis method, the existing penetration experiments of concrete slabs are numerically simulated and analyzed by employing the hydrocode LS-DYNA. Finally, numerical simulation of the project...

Taiyuan University of technology 2017,48(01): ZHANG Jie, WANG Zhihua, SHU Xuefeng. ;

PDFviewed：abstract

Characterizing Operator Sum Representation of Discord Annihilating Quantum Channels

In the note, we give a characterization of operator sum representation of discord an- nihilating channels. Furthermore, we prove that a quantum channel Φ is discord-annihilating if and only if ΦId maps the maximum entangled state to a state with zero discord....

Taiyuan University of technology 2017,48(01): WANG Faqiang, WANG Li, HE Kan. ;

PDFviewed：abstract

The Characterizing of the Class of Everywhere Separable Graphs Under the Network Perspective

In this paper, under the discussion of graph properties, we mainly study the problems of graph construction of everywhere separable graphs. Given the graph parameters (such as the maximum clique number and connectivity) of the graph, two methods of structuring an every- where separable graph are obtained. At the same time, we extend an everywhere separable graph to an everywhere separable network. From a point of network, new prospects of this class of graphs are revealed....

Taiyuan University of technology 2017,48(01): WU Jian. ;

PDFviewed：abstract