Previous studies have identified changes of mechanical properties of airway smooth muscle (ASM) from a canine model of atopic airway hyperreactivity. These changes, including increased maximum ...shortening capacity (delta Lmax) and early shortening velocity (Vo), may be responsible for the airway hyperresponsiveness in asthma. We have suggested that these changes may be due to increased actomyosin ATPase activity, controlled via phosphorylation of the 20 kD myosin light chain (MLC20) by MLC kinase (MLCK). Therefore, ATPase activity, MLC20 phosphorylation, and MLCK content and activity were assessed in tracheal and bronchial smooth muscles (TSM and BSM) of ragweed pollen-sensitized dogs (S) and their littermate controls (C). Specific ATPase activities from STSM and SBSM were significantly higher than their control counterparts (CTSM, CBSM). Phosphorylation of MLC20 in STSM was greater both at rest and during electrical stimulation due to the increased amount of MLCK in STSM and SBSM by 30 and 25%, respectively. MLCK activity was also increased significantly in STSM and SBSM (from 46.99 +/- 8.33 and 42.85 +/- 5.92 to 91.9 +/- 6.43 and 64.12 +/- 7.88 32P mmol/mg fresh tissue weight/min respectively mean +/- SEM). When normalized to the amount of MLCK in the tissue, however, specific MLCK activity in STSM and SBSM was similar to that in controls. It is unlikely that myosin phosphatase plays any role in the changes of MLC20 phosphorylation in sensitized animals. Peptide mapping showed no visible change in primary structure of MLCK in STSM and SBSM compared with those of controls. We report that ASM actomyosin ATPase activity is increased in STSM and SBSM. The increased ATPase activity is the result of increased MLC20 phosphorylation, the latter likely resulting from the increased MLCK content, which may account for the hyperresponsiveness found in ASM from these animals.
A graph is said to be {\it total-colored} if all the edges and the vertices
of the graph are colored. A total-coloring of a graph is a {\it total
monochromatically-connecting coloring} ({\it ...TMC-coloring}, for short) if any
two vertices of the graph are connected by a path whose edges and internal
vertices have the same color. For a connected graph $G$, the {\it total
monochromatic connection number}, denoted by $tmc(G)$, is defined as the
maximum number of colors used in a TMC-coloring of $G$. In this paper, we study
two kinds of Erd\H{o}s-Gallai-type problems for $tmc(G)$ and completely solve
them.
We have fabricated a mesoporous copolymer thin film whose surface pore size can be varied from submicrometer to micrometer. Our fabrication method requires microphase separation induced by a silicone ...surfactant during the rapid solvent evaporation and polymerizations. The sample films were characterized with atomic force microscopy (AFM), confocal Raman spectroscopy, X-ray photoelectron spectroscopy (XPS), in situ infrared (IR), attenuated total reflection (ATR), and other techniques. The characterization results show that the pore size can be controlled by altering the concentration of silicone surfactant. Furthermore, the mesoporous copolymer film with hydrophobic convex and hydrophilic concave structure exhibits both hydrophobic and oleophobic properties. The unique properties can be attributed to the special heterogeneous porous structure of the polymer film. The resulting porous polymer films can be utilized in many fields, such as self-cleaning, antiadhesives, adsorption, and separation. These mesoscale-patterned surfaces can also provide a model system for investigating the interface properties of actual surfaces.
Full text
Available for:
IJS, KILJ, NUK, PNG, UL, UM
Nowadays, the traditional separate management mode of planning data and graphics has certain limitations, and cannot meet the needs of power grid business development. Therefore, a GIS-based graphics ...management system is proposed based on cloud platform, in which the grid map, power grid GIS, and electrical wiring diagram are organically integrated based on cloud services. The integration of basic information of power grid, the actual geographic information, the government planning information, and geographic sensitive point information, makes it possible for the graphics to meet different data analysis and planning requirements. The organic combination with geographic information system (GIS) platform, smart distribution network platform, production management system (PMS) and energy management system (EMS), makes it possible for the system to improve the effectiveness of power grid planning decision-making. Field application of Shandong provincial power grid of China shows the economic benefit and management benefit of the system.
This paper investigates a consensus problem of the fractional version of second-order system with communication delay under both directed and undirected topologies. By applying the frequency domain ...method, a sufficient condition is given to ensure the fractional version of second-order consensus facing communication delays. It is proof that fractional version of second-order consensus can be reached if the time delay is not exceeding than the delay upper bound. Finally, a numerical example is provided to verify the effectiveness and correctness of the proposed consensus control protocol.
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting coloring} ({\it ...TMC-coloring}, for short) if any two vertices of the graph are connected by a path whose edges and internal vertices on the path have the same color. For a connected graph \(G\), the {\it total monochromatic connection number}, denoted by \(tmc(G)\), is defined as the maximum number of colors used in a TMC-coloring of \(G\). Note that a TMC-coloring does not exist if \(G\) is not connected, in which case we simply let \(tmc(G)=0\). In this paper, we first characterize all graphs of order \(n\) and size \(m\) with \(tmc(G)=3,4,5,6,m+n-2,m+n-3\) and \(m+n-4\), respectively. Then we determine the threshold function for a random graph to have \(tmc(G)\geq f(n)\), where \(f(n)\) is a function satisfying \(1\leq f(n)<\frac{1}{2}n(n-1)+n\). Finally, we show that for a given connected graph \(G\), and a positive integer \(L\) with \(L\leq m+n\), it is NP-complete to decide whether \(tmc(G)\geq L\).
Focusing on the issue of quality tracing for discrete manufacturing workshop, a conceptual framework for quality tracing system integrating product batch information tracing and root causes tracing ...for quality faults is proposed. Based on the machining process-related batch information, quality information and machining status information, which are automatically real-time collected by using RFID technology and Auto-ID computing technology, the proposed system can carry out forward traceability, backward traceability and root causes tracing for quality accidents. Then, key enabling technologies for the system is presented in detail. Finally, a prototype system based on browser/server (B/S) architecture is developed, and a simple case is given to verify the feasibility of the proposed framework.
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is a {\it total monochromatic path} if all the edges and internal ...vertices on the path have the same color. A total-coloring of a graph is a {\it total monochromatically-connecting coloring} ({\it TMC-coloring}, for short) if any two vertices of the graph are connected by a total monochromatic path of the graph. For a connected graph \(G\), the {\it total monochromatic connection number}, denoted by \(tmc(G)\), is defined as the maximum number of colors used in a TMC-coloring of \(G\). These concepts are inspired by the concepts of monochromatic connection number \(mc(G)\), monochromatic vertex connection number \(mvc(G)\) and total rainbow connection number \(trc(G)\) of a connected graph \(G\). Let \(l(T)\) denote the number of leaves of a tree \(T\), and let \(l(G)=\max\{ l(T) | \) \(T\) is a spanning tree of \(G\) \(\}\) for a connected graph \(G\). In this paper, we show that there are many graphs \(G\) such that \(tmc(G)=m-n+2+l(G)\), and moreover, we prove that for almost all graphs \(G\), \(tmc(G)=m-n+2+l(G)\) holds. Furthermore, we compare \(tmc(G)\) with \(mvc(G)\) and \(mc(G)\), respectively, and obtain that there exist graphs \(G\) such that \(tmc(G)\) is not less than \(mvc(G)\) and vice versa, and that \(tmc(G)=mc(G)+l(G)\) holds for almost all graphs. Finally, we prove that \(tmc(G)\leq mc(G)+mvc(G)\), and the equality holds if and only if \(G\) is a complete graph.
Total proper connection of graphs Jiang, Hui; Li, Xueliang; Zhang, Yingying
arXiv (Cornell University),
12/2015
Paper, Journal Article
Open access
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a {\it total proper path} if \((i)\) any two adjacent edges on ...the path differ in color, \((ii)\) any two internal adjacent vertices on the path differ in color, and \((iii)\) any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph is called {\it total-proper connected} if any two vertices of the graph are connected by a total proper path of the graph. For a connected graph \(G\), the {\it total proper connection number} of \(G\), denoted by \(tpc(G)\), is defined as the smallest number of colors required to make \(G\) total-proper connected. These concepts are inspired by the concepts of proper connection number \(pc(G)\), proper vertex connection number \(pvc(G)\) and total rainbow connection number \(trc(G)\) of a connected graph \(G\). In this paper, we first determine the value of the total proper connection number \(tpc(G)\) for some special graphs \(G\). Secondly, we obtain that \(tpc(G)\leq 4\) for any \(2\)-connected graph \(G\) and give examples to show that the upper bound \(4\) is sharp. For general graphs, we also obtain an upper bound for \(tpc(G)\). Furthermore, we prove that \(tpc(G)\leq \frac{3n}{\delta+1}+1\) for a connected graph \(G\) with order \(n\) and minimum degree \(\delta\). Finally, we compare \(tpc(G)\) with \(pvc(G)\) and \(pc(G)\), respectively, and obtain that \(tpc(G)>pvc(G)\) for any nontrivial connected graph \(G\), and that \(tpc(G)\) and \(pc(G)\) can differ by \(t\) for \(0\leq t\leq 2\).
Based on the long-track EV (Electric Vehicle) dynamic wireless charging system, this paper aims to offset the vehicle's driving power by wireless charging in real time while the vehicle is driving in ...the charging area. By studying the influence of speed on the EV power demand during driving, and the effect on the direction of system parameter adjustment in the critical compensation state, the dynamic EV wireless charging power control method by adjusting the voltage value of the transmitting end or adjusting the equivalent load resistance value of the electric vehicle is proposed.
