The common method classifying tactile qualities of fabrics is indirectly based on their difference of purely mechanical and physical properties. When human skin slides across fabric surfaces, the friction interaction between fabrics and skin will occur and trigger the cutaneouS tactile receptors, which are responsible for perceived tactile sensation. By the extracted features from friction- induced vibration signals, this paper presents an anthropomorphic classification method classifying tactile qualities of fabrics. The friction-induced vibration signals are recorded by a three-axis accelerator sensor, and the entice testing procedure is conducted in an anthropomorphic way to obtain vibration signals. The fast Fourier transform （FFT） is applied to analyzing the recoded signals, and then the classification features are extracted from the FFT data by the neurophysiological properties of tactile receptors. The extracted features are used to classify fabric samples by the softness sensation and the roughness sensation, respectively, and the classification performance is checked by a comparison with those in a sensory evaluation procedure. The results showed that the anthropomorphic objective classification method was precise and efficient to clarify tactile qualities of woven fabrics.
We consider differentiated timecritical task scheduling in a N×N input queued optical packet s w itch to ens ure 100% throughput and meet different delay requirements among various modules of data center. Existing schemes either consider slot-by-slot scheduling with queue depth serving as the delay metric or assume that each input-output connection has the same delay bound in the batch scheduling mode. The former scheme neglects the effect of reconfiguration overhead, which may result in crippled system performance, while the latter cannot satisfy users’ differentiated Quality of Service(Qo S) requirements. To make up these deficiencies, we propose a new batch scheduling scheme to meet the various portto-port delay requirements in a best-effort manner. Moreover, a speedup is considered to compensate for both the reconfiguration overhead and the unavoidable slots wastage in the switch fabric. With traffic matrix and delay constraint matrix given, this paper proposes two heuristic algorithms Stringent Delay First(SDF) and m-order SDF(m-SDF) to realize the 100% packet switching, while maximizing the delay constraints satisfaction ratio. The performance of our scheme is verified by extensive numerical simulations.
'/%3e%3cuse xlink:href='%23a' transform='rotate(23.036 .093 25.536)'/%3e%3cuse xlink:href='%23a' transform='rotate(45.87 1.273 16.18)'/%3e%3cuse xlink:href='%23a' transform='rotate(69.945 .996 12.078)'/%3e%3cuse xlink:href='%23a' transform='rotate(20.66 -19.689 31.932)'/%3e%3c/svg%3e)
'/%3e%3cuse xlink:href='%23a' transform='rotate(144 450 300)'/%3e%3cuse xlink:href='%23a' transform='rotate(216 450 300)'/%3e%3cuse xlink:href='%23a' transform='rotate(288 450 300)'/%3e%3c/svg%3e)