EFFECTS OF POLYTROPIC EXPONENT ON DATA PROCESSING METHODS USED IN CONSTANT VOLUME DISCHARGE

In order to obtain the accurate sonic conductance of solenoid valves, the polytropic exponent is used in the data processing of the discharge method for measuring the flow rate characteristics of pneumatic components. Three data processing principles are first introduced, and then the discharge pressure data obtained from the measured solenoid valve are processed to obtain the sonic conductance with three methods： the partial polytropic exponent method, the complete polytropic exponent method and the adiabatic method. By comparison of the obtained results it indicates that the complete polytropic exponent method is the most accurate. However, the partial polytropic exponent method is of a high applicable value, because it is easy and simple to measure and the obtained results are relatively accurate.

Discharge Modes Suggested by Emission Spectra of Nitrogen Dielectric Barrier Discharge with Wire-Cylinder Electrodes

In this paper,nitrogen dielectric barrier discharge（DBD） plasma was generated in a quartz tube with coaxial wire-cylinder electrodes at atmospheric pressure.By varying the nitrogen gas flow（FN） in the range of 0-1 m3/h,the plasma optical emission spectra（OES） were measured and studied.The vibration（T_（vib）） and rotation temperature（T_（rot）） of nitrogen were obtained,by fitting the rovibronic bands of N_2（C^3∏_u-B^3∏_g,0-1）,and by the Boltzmann plot method for purposes of comparison.T_（vib） increased up to 2481 K with increasing nitrogen flow till0.2 m3/h,and then decreased with further increasing FN,while Trot decreased monotonously and approached to-350 K for FN ≥ 0.6 m^3/h.The intensity of N_2（C^3∏_u-B^3∏_g,0-0,1-0,0-3） and N_2~＋（B^2∑_u~＋-X^2Σ_g~＋,0-0） exhibited similar evolution with increasing FN to those of the T_（vib） and Trot,respectively.The discharge photos revealed that the discharge filaments gradually decreased with increasing FN,and eventually disappeared,which implied that a discharge mode transition emerged with increasing FN.The possible mechanism for the discharge mode transition is studied in detail according to the vibration（T_（vib）） and rotation temperature（T_（rot）） of nitrogen.

Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10

A neighbor sum distinguishing(NSD)total coloringφof G is a proper total coloring of G such thatΣz∈EG(u)U{u}φ(z)≠Σz∈EG(v)U{v}φ(z)for each edge uv∈E(G),where EG(u)is the set of edges incident with a vertex u.In 2015,Pilśniak and Wozniak conjectured that every graph with maximum degreeΔhas an NSD total(Δ+3)-coloring.Recently,Yang et al.proved that the conjecture holds for planar graphs withΔ≥10,and Qu et al.proved that the list version of the conjecture also holds for planar graphs withΔ≥13.In this paper,we improve their results and prove that the list version of the conjecture holds for planar graphs withΔ≥10.

An Optimal Charging/Discharging Strategy for Smart Electrical Car Parks

This paper presents a smart electrical car park model where the power flows among electrical vehicles(EVs)as well as between EVs and the main grid.Based on this model,an optimal charging/discharging scheme is proposed.The fluctuation of hourly electricity rates is considered in this strategy to select a proper charging/discharging rate for each EV with less expenditure during each charging period.The proposed smart electrical car park is able to buy or sell electricity in the form of active and/or reactive power,i.e.kWh and/or kVARh,from or to the main grid to improve the power quality.According to the current state of charge of the EV’s battery bank,customers and the grid demands,a control center makes the decisions and sends the instructions of specific charging/discharging mode to each charging station.The performance of the proposed charging/discharging algorithm is simulated in Matlab.A comparison between the proposed and the unregulated charging/discharging strategies has been implemented.The results demonstrate that the proposed scheme can achieve better economic profits for EV customers and increase the commercial benefits for the car park owner.

A Totally(Δ+1)-colorable 1-planar Graph with Girth at Least Five

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we prove that every 1-planar graph G with maximum degree △（G） 〉 12 and girth at least five is totally （△（G）＋1）-colorable.

On Total Colorings of Some Special 1-planar Graphs

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we verify the total coloring conjecture for every 1-planar graph G if either △（G） ≥9 and g（G）≥ 4, or △（G） ≥ 7 and g（G）≥5, where △（G） is the maximum degree of G and g（G） is the girth of G.

Total-coloring of Sparse Graphs with Maximum Degree 6

Given a graph G=(V,E)and a positive integer k,a k-total-coloring of G is a mappingφ:V⋃E→{1,2,⋯,k}such that no two adjacent or incident elements receive the same color.The central problem of the total-colorings is the Total Coloring Conjecture,which asserts that every graph of maximum degreeΔadmits a(Δ+2)-total-coloring.More precisely,this conjecture has been verified forΔ≤5,and it is still open whenΔ=6,even for planar graphs.Let mad(G)denote the maximum average degree of the graph G.In this paper,we prove that every graph G withΔ(G)=6 and mad(G)<23/5 admits an 8-total-coloring.