Moving vehicle load identification from bridge responses based on method of moments (MOM)

A MOM-based algorithm (MOMA) is proposed for identifying of the time-varying moving vehicle loads on a bridge in this paper. A series of numerical simulations and experiments in laboratory have been studied and the proposed MOMA are compared with the existing time domain method (TDM). A few main parameters, such as basis function terms, executive CPU time, Nyquist fraction of digital filter, two different solutions to the ill-posed system equation, etc, have been investigated. Both the numerical simulation and experimental results show that the MOMA has higher identification accuracy and robust noise immunity as well as producing an acceptable solution to ill-conditioning cases to some extent, but its CPU execution time is just less than one tenth of the TDM

Cytoplasmic and Nuclear Localization of TCTP in Normal and Cancer Cells

Objective. Intracellular localization of translationally controlled tumour protein (TCTP) was investigated in cancer cells. Methods. The expression and localization of TCTP were detected at 12 h, 24 h, 48 h, 60 h time points in culture of human hepatocarcinoma cell line HepG2, human cervical carcinoma cell line HeLa, and human normal liver cell line HL-7702 by immunofluorescence. Results. TCTP was expressed in both normal and tumor cells, and its localization changes at different time points. TCTP was mainly expressed in cytoplasm from 24 h to 48 h then expressed in both nucleus and cytoplasm at 60 h in HL-7702 cells. While in HepG2 cells, TCTP first localized at cell membrane within 24 h then at both nucleus and cytoplasm from 48 h to 60 h; TCTP localized at both nucleus and cytoplasm from 12 h to 60 h in Hela cells. Conclusion. The translocation of intracellular expression of TCTP in normal and tumor cells at different time points may pave a path to the studying of TCTP role in tumor growth

Translocation and metabolism of tricresyl phosphate in rice and microbiome system: Isomer-specific processes and overlooked metabolites.

Tricresyl phosphate (TCP) is extensively used organophosphorus flame retardants and plasticizers that posed risks to organisms and human beings. In this study, the translocation and biotransformation behavior of isomers tri-p-cresyl phosphate (TpCP), tri-m-cresyl phosphate (TmCP), and tri-o-cresyl phosphate (ToCP) in rice and rhizosphere microbiome was explored by hydroponic exposure. TpCP and TmCP were found more liable to be translocated acropetally, compared with ToCP, although they have same molecular weight and similar Kow. Rhizosphere microbiome named microbial consortium GY could reduce the uptake of TpCP, TmCP, and ToCP in rice tissues, and promote rice growth. New metabolites were successfully identified in rice and microbiome, including hydrolysis, hydroxylated, methylated, demethylated, methoxylated, and glucuronide- products. The methylation, demethylation, methoxylation, and glycosylation pathways of TCP isomers were observed for the first time in organisms. What is more important is that the demethylation of TCPs could be an important and overlooked source of triphenyl phosphate (TPHP), which broke the traditional understanding of the only man- made source of toxic TPHP in the environment. Active members of the microbial consortium GY during degradation were revealed and metagenomic analysis indicated that most of active populations contained TCP- degrading genes. It is noteworthy that the strains and function genes in microbial consortium GY that responsible for TCP isomers’ transformation were different. These results can improve our understanding of the translocation and transformation of organic pollutant isomers in plants and rhizosphere microbiome

Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic

Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. In order to construct a delay-constrained multicast routing tree, average distance heuristic (ADH) algorithm is analyzed firstly. Then a delay-constrained algorithm called DCADH (delay-constrained average distance heuristic) is presented. By using ADH a least cost multicast routing tree can be constructed; if the path delay can't meet the delay upper bound, a shortest delay path which is computed by Dijkstra algorithm will be merged into the existing multicast routing tree to meet the delay upper bound. Simulation experiments show that DCADH has a good performance in achieving a low-cost multicast routing tree.Comment: 8 Pages, IJCNC Journal 201