Furniture Recognition in Scene Pictures (Hägenläuer, Henzler, Scholz, english, 07.03.2015)

Applications for automatic identification of objects in scene images, called auto-tagging, range from image database organization over visual search to e-commerce. In this paper our effort to identify specific pieces of furniture in cluttered scenes based on ideal models using object recognition techniques are discussed. The extraction of local features and naive nearest neighbor matching followed by a geometric verification are compared to the Bag of Words (BoW) and the Spatial Pyramid Matching Kernel (SPMK) approach. As expected the naive matching of local features generated the worst results whereas the SPMK method yields the best results and was therefore closer examined. We propose a spatial based, additional layer weights of weight to be added to SPMK for this specific application. Our results still not satisfy the desired use case, reliable recognition of furniture, but can be used as lead for further research.

Security Threats and Aspects in RFID and NFC communication (english, 20.02.2015)

Abstract The following paper discusses security threats and aspects in Radio Frequency Identi fication and Near Field Communication. Therefore Privacy-Violations, Authentication problems, problems with low-cost RFID Tags and basic threats like destruction are explained. Furthermore eavesdropping, data corruption, modifi cation and insertion are a security threat in the communication. Only a Man-in-the-Middle attack is complicated to implement for an attacker

Simulate M/M/1 queues with RabbitMQ and compare results to Queuing Theory (english, 05.03.2014)

Abstract Queuing Theory deals with the mathematical consideration of waiting queues. This paper simulates a M/M/1 queue, which is the simplest model in Queuing Theory, with the help of the server software Rabbit MQ. Thereby the average number of users in the queuing system and in the queue is measured. Furthermore the average time in the queuing system per user and the waiting time in the queue per user is calculated. The resulting values of 25 runs are compared to the expected values of the equations by the Queuing Theory. The results show that the expected value is nearby the mean of the simulation and most likely in the 95% confidence interval around the mean value. Moreover the FIFO property of M/M/1 queues is confirmed.