Effect of airflow direction on human perception of draught
Forty subjects, 20 women and 20 men, were exposed to airflows from five different directions: horizontally towards the front, the back, and the left side and vertically upwards and downwards. The subjects were exposed to stepwise increased air velocities ranging from less than 0.10 m/s to 0.40 m/s at three temperature levels 20, 23 and 26 o C. The results showed that airflow direction has an impact on perceived discomfort due to draught. At 20 o C and 23 o C, airflow from below was perceived as most uncomfortable followed by airflows towards the back and front. At 26 o C airflow from above and towards the back caused most dissatisfaction due to draught, but generally only a few of the subjects perceived discomfort at this temperature. Discomfort due to draught was most often felt at the body regions directly exposed to the airflow. These were the legs, the feet, and the lower back at airflow from below; the neck, the shoulders and the hands at airflow from above; the neck, the back, the shoulders and the legs at airflow from behind; the knee and the arm facing the windbox when exposed to air movements directed towards the side; and the hands and the knees when exposed to air movements towards the front.
Experimental study of an intermittent ventilation system in high occupancy spaces
Spaces with high occupancy density like classrooms are challenging to ventilate and use a lot of energy to maintain comfort. Usually, a compromise is made between low energy use and good Indoor Env ...
Rubik's for cryptographers
Hard mathematical problems are at the core of security arguments in cryptography. In this paper, we study mathematical generalizations of the famous Rubik’s cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups. These problems arise naturally when describing the security of Cayley hash functions, a class of cryptographic hash functions with very interesting properties. The factorization problem is also strongly related to a famous long-standing conjecture of Babai, at the intersection of group theory and graph theory. A constructive proof of Babai’s conjecture would make all Cayley hash functions insecure, but on the other hand it would have many positive applications in graph theory and computer science. In this paper, we classify existing attacks against Cayley hash functions and we review known results on Babai’s conjecture. Despite recent cryptanalytic progress on particular instances, we show that the factorization, representation and balance problems presumably remain good sources of cryptographic hard problems. Our study demonstrates that Cayley hash functions deserve further interest by the cryptography community.