Refine
H-BRS Bibliography
- yes (69)
Departments, institutes and facilities
- Fachbereich Informatik (69) (remove)
Document Type
- Conference Object (42)
- Article (17)
- Part of a Book (4)
- Conference Proceedings (2)
- Book (monograph, edited volume) (1)
- Research Data (1)
- Master's Thesis (1)
- Report (1)
Year of publication
- 2016 (69) (remove)
Keywords
Das Cutting sticks-Problem ist ein NP-vollständiges Problem mit Anwendungspotenzialen im Bereich der Logistik. Es werden grundlegende Definitionen für die Behandlung sowie bisherige Ansätze zur Lösung des Problems aufgearbeitet und durch einige neue Aussagen ergänzt. Insbesondere stehen Ideen für eine algorithmische Lösung des Problems bzw. von Varianten des Problems im Fokus.
WiFi-based Long Distance (WiLD) networks have emerged as a promising alternative approach for Internet in rural areas. However, the MAC layer, which is based on the IEEE802.11 standard, comprises contiguous stations in a cell and is spatially restricted to a few hundred meters at most. In this work, we summarize efforts by different researchers to use IEEE802.11 over long-distances. In addition, we introduce WiLDToken, our solution to optimizing the throughput and fairness and reducing the delay on WiLD links. Compared to previous alternative MAC layers protocols for WiLD, our focus is on optimizing a single link in a multi-radio multi-channel mesh. We implement our protocol in the ns-3 network simulator and show thatWiLDToken is superior to an adapted version of the Distributed Coordination Function (DCF) for different link distances. We find that the throughput on a single link is close to the physical data-rate without a major decrease over longer distances.
WiFi-based Long Distance (WiLD) networks have emerged as a promising alternative technology approach for providing Internet in rural areas. An important factor in network planning of these wireless networks is estimating the path loss. In this work, we present various propagation models we found suitable for point-to-point (P2P) operation in the WiFi frequency bands. We conducted outdoor experiments with commercial offthe- shelf (COTS) hardware in our testbed made of 7 different long-distance links ranging from 450 m to 10.3 km and a mobile measurement station. We found that for short links with omni-directional antennas ground-reflection is a measurable phenomenon. For longer links, we show that either FSPL or the Longley-Rice model provides accurate results for certain links. We conclude that a good site survey is needed to exclude influences not included in the propagation models.
The SpMV operation -- the multiplication of a sparse matrix with a dense vector -- is used in many simulations in natural and engineering sciences as a computational kernel. This kernel is quite performance critical as it is used, e.g.,~in a linear solver many times in a simulation run. Such performance critical kernels of a program may be optimized on certain levels, ranging from using a rather coarse grained and comfortable single compiler optimization switch down to utilizing architecural features by explicitly using special instructions on an assembler level. This paper discusses a selection of such program optimization techniques in this spectrum applied to the SpMV operation. The achievable performance gain as well as the additional programming effort are discussed. It is shown that low effort optimizations can improve the performance of the SpMV operation compared to a basic implementation. But further than that, more complex low level optimizations have a higher impact on the performance, although changing the original program and the readability / maintainability of a program significantly.
The Eighth International Conference on Future Computational Technologies and Applications (FUTURE COMPUTING 2016), held between March 20-24, 2016 in Rome, Italy, continued a series of events targeting advanced computational paradigms and their applications. The target was to cover (i) the advanced research on computational techniques that apply the newest human-like decisions, and (ii) applications on various domains. The new development led to special computational facets on mechanism-oriented computing, large-scale computing and technology-oriented computing. They are largely expected to play an important role in cloud systems, on-demand services, autonomic systems, and pervasive applications and services.
Design of an Active Multispectral SWIR Camera System for Skin Detection and Face Verification
(2016)
Biometric face recognition is becoming more frequently used in different application scenarios. However, spoofing attacks with facial disguises are still a serious problem for state of the art face recognition algorithms. This work proposes an approach to face verification based on spectral signatures of material surfaces in the short wave infrared (SWIR) range. They allow distinguishing authentic human skin reliably from other materials, independent of the skin type. We present the design of an active SWIR imaging system that acquires four-band multispectral image stacks in real-time. The system uses pulsed small band illumination, which allows for fast image acquisition and high spectral resolution and renders it widely independent of ambient light. After extracting the spectral signatures from the acquired images, detected faces can be verified or rejected by classifying the material as "skin" or "no-skin". The approach is extensively evaluated with respect to both acquisition and classification performance. In addition, we present a database containing RGB and multispectral SWIR face images, as well as spectrometer measurements of a variety of subjects, which is used to evaluate our approach and will be made available to the research community by the time this work is published.