An investigation of safety design practices of metal machines

BACKGROUND: Machinery safety issues are a challenge facing manufacturers who are supposed to create and provide products in a better and faster way. In spite of their construction and technological advance, they still contribute to many potential hazards for operators and those nearby. OBJECTIVE: The aim of this study is to investigate safety aspects of metal machinery offered for sale on Internet market according to compliance with minimum and fundamental requirements. METHODS: The study was carried out with the application of a checklist prepared on the basis of Directive 2006/42/EC and Directive 2009/104/EC and regulations enforcing them into Polish law. RESULTS: On the basis of the study it was possible to reveal the safety aspects that were not met in practice. It appeared that in the case of minimum requirements the most relevant problems concerned information, signal and control elements, technology and machinery operations, whereas as far as fundamental aspects are concerned it was hard to assure safe work process. CONCLUSIONS: In spite of the fact that more and more legal acts binding in the Member Countries of the European Union are being introduced to alleviate the phenomenon, these regulations are often not fulfilled.

Designing next generation car washing machines with rotary brushes

Tese de Doutoramento - Leaders for Technical Industries (LTI) - MIT Portugal

Parallel improved Schnorr-Euchner enumeration SE++ for the CVP and SVP

The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.

An evolutionary approach to the use of Petri net based models: from parallel controllers to HW/SW co-design

"A workshop within the 19th International Conference on Applications and Theory of Petri Nets - ICATPN’1998"