Effect of Knitting Process on Elastic Property of Polyethylene Terephthalate (PET)/Polybutylene Terephthalate (PBT) Warp Knitted Fabric

This study investigated the elastic elongation and elastic recovery of the elastic warp knitted fabric made of polyethylene terephthalate( PET) and polybutylene terephthalate( PBT)filament. The effect of knitting parameter on the elasticity of PBT /PET warp knitted fabric was analyzed. The increase of drawing density( from 16 to 26 courses per centimeter( CPC)) on machine resulted in the decrease of elongation at the weft direction. But,the elongation at the warp direction fluctuated as drawing density increasing. The yarn run-in speed influenced the elongation of PET /PBT warp knitted fabric as well. When the yarn run-in speed of GB1( front bar) was kept a constant,the increase of GB2( back bar) yarn run-in speed caused the gradual enhancement of the elastic elongation at the warp direction,but the different trends of the elastic elongation at the weft direction. When yarn run-in speed of GB2 was kept a constant,the increase of GB1 yarn run-in speed enlarged the elastic warp elongation from 104.16 to 124.97 mm,while the weft elongation decreased from 110.34 to 98.03 mm.Eventually yarn run-in speeds of GB1 and GB2 were retained at1 360 and 1 170 mm / rack respectively under 20 CPC drawing density. It could not only balance the two directions of elongation but also reach the highest elongation at both directions( 126. 32 and115.88 mm) under 100 N tension. These results provide a better understanding of characteristics of PET / PBT warp knitted fabric,and its elastic elongation and recovery behavior for development and effective applications.

Microstructure and mechanical properties of low carbon steel wires with serial and reverse-direction cold drawing

Low carbon steel wires were prepared by two processes,serial drawing(SD)and reverse-direction drawing(RD).Effects of the two processes on microstructure and mechanical properties in steel wires were investigated by field emissio scanning electron microscopy,electron backscatter diffraction(EBSD),X-ray diffraction and transmission electron microscopy(TEM).Residual compressive stress and more low-angle grain boundaries were introduced into the steel wire by the RD.As a result,the RD wires exhibited a greater tensile strength when drawing strain s<1.18.The SD encouraged grain refinement and texture formation in the wire.The SD wires exhibited a smaller average width of the elongated ferrite grain and a higher intensity of(110)fiber texture at all drawing strains.Therefore,the SD wires showed a bit greater tensile strength and 20%greater torsion performance than the RD wires at c=2.51.TEM and EBSD analysis indicated that dislocation tangle was formed easily in RD wires,and it transformed into twist boundary.This twist boundary impeded the grain refinement in the RD wires,and there were still non-fibrous grains in the RD wires even after heavy drawing.

Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing Problems

We analyze a common feature of p-Kemeny AGGregation（p-KAGG） and p-One-Sided Crossing Minimization（p-OSCM） to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG—a problem in social choice theory—and for p-OSCM—a problem in graph drawing. These algorithms run in time O＊（2O（√k log k））,where k is the parameter, and significantly improve the previous best algorithms with running times O.1.403k/and O.1.4656k/, respectively. We also study natural ＂above-guarantee＂ versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p-directed feedback arc set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of ＂votes＂ in the input to p-KAGG is odd the above guarantee version can still be solved in time O＊（2O（√k log k））, while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails（equivalently, unless FPT D M[1]）.