For current physical examination and medical institutions, the majority of Medical projects need a long time to get the result, this wastes user too much time. In order to solve this problem, this paper presents a program to achieve viewing the results of examination anytime or anywhere with the help of cell phone applications software. The program proposed to solve the problem that user have to wait for the medical test results for a long time and cause the time waste, compared to the programs which using e-mail, SMS and mailing report card to inform the user the results, this one is to be more efficient, while also better meet user and medical institutions’ requirements. In addition, in order to test the practicality and feasibility of the program, with IOS devices as the material basis, this paper constructs a Web client system, based on the GPRS technology, we can realize the data communications between the Web server and a client which is the workbench IOS devices. Through testing, we can proof this Web client system has certain practical and development value, with the physical examination institutions become popular gradually, I believe that this design ideas of the system will be used extensively in the medical system, and also will bring a person more convenient.

Abstract:
We determined the promoter methylation of 6 genes and PIK3CA amplification using quantitative methylation-specific PCR (Q-MSP) and real-time quantitative PCR, respectively, and explore the association of promoter methylation with PIK3CA amplification in a large cohort of clinically well-characterized non-small cell lung cancer (NSCLC).Highly frequent promoter methylation was observed in NSCLC. With 100% diagnostic specificity, excellent sensitivity, ranging from 45.8 to 84.1%, was found for each of the 6 genes. The promoter methylation was associated with histologic type. Methylation of CALCA, CDH1, DAPK1, and EVX2 was more common in squamous cell carcinomas (SCC) compared to adenocarcinomas (ADC). Conversely, there was a trend toward a higher frequency of RASSF1A methylation in ADC than SCC. In addition, PIK3CA amplification was frequently found in NSCLC, and was associated with certain clinicopathologic features, such as smoking history, histologic type and pleural indentation. Importantly, aberrant promoter methylation of certain genes was significantly associated with PIK3CA amplification.Our data showed highly frequent promoter methylation and PIK3CA amplification in Chinese NSCLC population, and first demonstrated the associations of gene methylation with PIK3CA amplification, suggesting that these epigenetic events may be a consequence of overactivation of PI3K/Akt pathway.Lung cancer is the number one cancer killer in China and soon will reach epidemic levels worldwide [1]. Epidemiological evidence has documented that approximately 41.8 men and 19.3 women per 100,000 Chinese individuals died of lung cancer in 2005 [2]. This disease is largely associated with smoking. While in developed countries smoking rates are decreasing, the use of tobacco products is increasing in the developing countries. In combination with a spike in the number of lung cancer cases in never smokers, this ensures that lung cancer will remain a major health problem [3]. Lung cancer is

Abstract:
Primary lung cancer remains the leading cause of cancer death worldwide. Promoter hypermethylation is a major inactivation mechanism of tumor-related genes, and increasingly appears to play an important role in carcinogenesis. In the present study, we used quantitative methylation-specific PCR (Q-MSP) assays to analyze promoter hypermethylation of nine genes in a large cohort of well-characterized non-small cell lung cancer (NSCLC) and explore their associations with the clinicopathological features of tumor. We found that there were significant differences in methylation levels for six of nine gene promoters between cancerous and noncancerous lung tissues. More importantly, with 100% diagnostic specificity, high sensitivity, ranging from 44.9% to 84.1%, was found for each of the nine genes. Interestingly, promoter hypermethylation of most genes was closely associated with histologic type, which was more frequent in squamous cell carcinomas (SCC) than in adenocarcinomas (ADC). In addition, highly frequent concomitant methylation of multiple genes was found in NSCLC, particularly in SCC. Our data showed that multiple genes were aberrantly methylated in lung tumorigenesis, and that they were closely associated with certain clinicopathological features of NSCLC, particularly of the histologic type, suggesting that these hypermethylated genes could be potential biomarkers in early detection of NSCLC in high-risk individuals, as well as in evaluating the prognosis of NSCLC patients. (Folia Histochemica et Cytobiologica 2011, Vol. 49, No. 1, 132–141)

Abstract:
In the title complex, [Ni(C21H15ClN2O2)], the NiII ion is coordinated by two N and two O atoms from the tetradentate Schiff base ligand in a distorted square geometry. The crystal packing exhibits short intermolecular Ni...Ni distances of 3.273 (3) .

Abstract:
In the title compound, C13H9Br2N3O, the molecular skeleton, influenced by an intramolecular O—H...N hydrogen bond, is roughly planar, with a mean deviation of 0.033 . In the crystal, intermolecular N—H...O hydrogen bonds link the molecules into chains propagating in [100]. Weak intermolecular π–π interactions [centroid–centroid distances = 3.760 (3) and 3.723 (3) ] further consolidate the packing.

Abstract:
Recently, there are more demands for MICE talents with the rapid development of MICE economy. But the situation of MICE education can't meet the needs of the MICE talents, thus it restricts the development of competition ability of MICE industry. Therefore, developing exhibition education and creating newer exhibition education model are essential way to raise the competitiveness of MICE industry. We should combine theory teaching with practice teaching, combine education with training, combine doctor education, postgraduate education, bachelor education with vocational and technical education, combine MICE education with MICE research, and combine domestic education with abroad education to create newer exhibition education model and raise MICE talent international competitiveness.

Abstract:
Wastewater from cephalosporin production with high bio-toxicity is hard to degrade, and could cause great harm to environment and human being. In the present paper, wastewater from cephalosporin production was processed with biochemical treatments as follows: hydrolytic acidification- Up-flow Anaerobic Sludge Bed(UASB)-Sequencing Batch Reactor Activated Sludge Process(SBR)-biological activated carbon process(BAC). Among them, hydrolytic acidification could efficaciously enhance the biodegradability of wastewater, and greatly increase effects of the subsequent anaerobic-aerobic treatment. The final BAC process could effectively eliminate chemical oxygen demand (COD) and chroma of wastewater treated by aerobic treatment, where COD attained below 100mg/L and chroma was 40. Therefore, wastewater after the previous treatments basically conformed to the discharge standard of " Integrated wastewater discharge standard "(GB8978-1996).

Abstract:
Let be the set of all unicyclic graphs with vertices and cycle length . For any , consists of the (unique) cycle (say ) of length and a certain number of trees attached to the vertices of having (in total) edges. If there are at most two trees attached to the vertices of , where is even, we identify in the class of unicyclic graphs those graphs whose Laplacian spectral radii are minimal. 1. Introduction Following [1], let be a simple connected graph on vertices and edges (so is its order and is its size). For , the degree of is denoted by . Let be the maximum degree of . For two vertices and ？？( ) in , the distance between and , denoted by , is the number of edges in a shortest path joining and . Let be the set of all unicyclic graphs on vertices and the cycle length . So, if , then consists of the (unique) cycle (say ) of length and a certain number of trees attached to vertices of having (in total) edges. If the cycle length of a unicyclic graph is even (odd), we call it an even (odd) unicyclic graph. We may assume that vertices of are or for short only (ordered in a natural way around , say, in the clockwise direction). For each , let be a rooted tree (with as its root) attached to . Then, for each , we can write . If , for each , is a path , whose root is a vertex of minimum degree, then we write . Let be the adjacency matrix of and the diagonal matrix. Then the Laplacian matrix of is . Since is real symmetric and positive semidefinite, its eigenvalues are nonnegative real numbers. For a graph , we denote by the largest eigenvalue of and call it the Laplacian spectral radius. The investigation on the Laplacian spectral radius of graphs is an important topic in the theory of graph spectra. Since 1980s, there are several monographs and a lot of research papers published continually (see [2–7]). Recently, the problem concerning graphs with maximal or minimal Laplacian spectral radius of a given class of graphs has been studied by many authors. Guo [8] determined the first four graphs with the largest Laplacian spectral radius among all unicyclic graphs on vertices. In this paper, for any , if there are at most two trees attached to vertices of , where is even, we characterize in the class of even unicyclic graphs those graphs whose Laplacian spectral radii are minimal. 2. Main Results and Proofs Let be the principal submatrix obtained from by deleting the corresponding row and column of . Generally, let be the principal submatrix obtained from by deleting the corresponding rows and columns of all vertices of . For any square matrix , denote by the

Abstract:
We identify graphs with the maximal Laplacian spectral radius among all unicyclic graphs with vertices and diameter . 1. Introduction Following [1], let be a simple undirected graph on vertices and edges (so is its order and is its size). For , or denotes the degree of and denotes the set of all neighbors of vertex . A pendant vertex is a vertex of degree 1 and a pendant edge is an edge incident with a pendant vertex. Let . For two vertices and ( ), the distance between and is the number of edges in the shortest path joining and . The diameter of a graph is the maximum distance between any two vertices of . Let ( ) be a path of with (unless ). If , , then we call an internal path of ; if and , then we call a pendant path of ; if the subgraph induced by in is itself, that is, , then we call an induced path. Obviously, the shortest path between any two distinct vertices of is an induced path. We will use , to denote the graph obtained from by deleting a vertex , or an edge , respectively (this notation is naturally extended if more than one vertex, or edge, is deleted). Denote by and the cycle and the path with vertices, respectively. We call a unicyclic graph if , where is the number of vertices and is the number of edges. We will use to denote the sets of all unicyclic graphs with vertices and diameter . Let be a graph of order obtained from the cycle by attaching pendant edges and a path of length at one vertex of the cycle, and a path of length to another nonadjacent vertex of the cycle respectively, where . Let be the Laplacian matrix, where is the diagonal matrix and is the adjacency matrix. The matrix is real symmetric and positive semidefinite; the eigenvalues of can be arranged as , where the largest eigenvalue is called the Laplacian spectral radius of . The investigation on the Laplacian spectral radius of graphs is an important topic in the theory of graph spectra. Recently, the problem concerning graphs with maximal Laplacian spectral radius of a given class of graphs has been studied extensively. Li et al. [2] determined those graphs which maximized Laplacian spectral radius among all bipartite graphs with (edge-) connectivity at most and characterized graphs of order with cut-edges, having Laplacian spectral radius equal to . X. L. Zhang and H. P. Zhang [3] studied the largest Laplacian spectral radius of the bipartite graphs with vertices and cut edges and the bicyclic bipartite graphs, respectively. The Laplacian spectral radius of unicyclic graphs has been studied by many authors (see [4–6]). Liu et al. [7] determined the graphs with the

Abstract:
Undoped and nitrogen-doped Bi12TiO20 materials were synthesized by urea addition sol-gel method. By adding urea, undoped, and N-doped gel-type precursors were synthesized by low-temperature dehydrolyzation. Nitrogen-doped and undoped nanocrystalline Bi12TiO20 were prepared by annealing at 600∘C for 30 minutes. From UV-Vis absorption and diffuse reflection spectrum, the absorbing band shifted from 420 to 500 nm by nitrogen doping. The bonds of Ti–N and N–O were identified by XPS spectra from the prepared materials, and the enhancement of visible light absorption was attributed to nitrogen's substitution of oxygen. Photocatalytic properties of prepared materials were characterized by the decomposition of Rhodamine B illuminated by whole spectra of 300 W Xe light. The photocatalyst Bi12TiO20？N (=0.03) with N/(N