17 resultados para Geometry of numbers


Relevância:

80.00% 80.00%

Publicador:

Resumo:

Tribocharged polymers display macroscopically patterned positive and negative domains, verifying the fractal geometry of electrostatic mosaics previously detected by electric probe microscopy. Excess charge on contacting polyethylene (PE) and polytetrafluoroethylene (PTFE) follows the triboelectric series but with one caveat: net charge is the arithmetic sum of patterned positive and negative charges, as opposed to the usual assumption of uniform but opposite signal charging on each surface. Extraction with n-hexane preferentially removes positive charges from PTFE, while 1,1-difluoroethane and ethanol largely remove both positive and negative charges. Using suitable analytical techniques (electron energy-loss spectral imaging, infrared microspectrophotometry and carbonization/colorimetry) and theoretical calculations, the positive species were identified as hydrocarbocations and the negative species were identified as fluorocarbanions. A comprehensive model is presented for PTFE tribocharging with PE: mechanochemical chain homolytic rupture is followed by electron transfer from hydrocarbon free radicals to the more electronegative fluorocarbon radicals. Polymer ions self-assemble according to Flory-Huggins theory, thus forming the experimentally observed macroscopic patterns. These results show that tribocharging can only be understood by considering the complex chemical events triggered by mechanical action, coupled to well-established physicochemical concepts. Patterned polymers can be cut and mounted to make macroscopic electrets and multipoles.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm