Avancerad sökning
Visar resultat 1 - 5 av 7 uppsatser som matchar ovanstående sökkriterier.
1. Failure Inference in Drilling Bits: : Leveraging YOLO Detection for Dominant Failure Analysis
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Detecting failures in tricone drill bits is crucial in the mining industry due to their potential consequences, including operational losses, safety hazards, and delays in drilling operations. Timely identification of failures allows for proactive maintenance and necessary measures to ensure smooth drilling processes and minimize associated risks. LÄS MER
2. A Study on Data-driven Methods for Selection and Evaluation of Beam Subsets in 5G NR
Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknikSammanfattning : 5G New Radio is the next generation of mobile networks and it comes with promises of ultra-high speeds, ultra-high reliability and ultra-low latency. This has posed a challenge for the engineers entrusted with the task of finding solutions which could fulfil the specification, and as a result, some promising areas have received increased attention in recent years. LÄS MER
3. Jämförande studie om hantering av fragment och lösa delar med okänd tillhörighet i en samling
Kandidat-uppsats, Göteborgs universitet/Institutionen för kulturvårdSammanfattning : It sometimes happens that loose fragments are found in a collection. Museums and historic houses often have routines for collecting these pieces for a future assembly. But fragments and loose parts may have been found and collected a long time ago. Unidentified fragments like these are difficult to link to their objects. LÄS MER
4. Analysis of IPv6 Neighbor Discovery for Mobile and Wireless Networks
Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknikSammanfattning : The majority of the current 3GPP and M2M networks use or will use IPv6 for accessing the internet. These IPv6 networks use Neighbor Discovery as defined in RFC 4861 to identify their neighbors on the link and see if they are active. LÄS MER
5. Implementation of bit-vector variables in a CP solver, with an application to the generation of cryptographic S-boxes
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : We present a bit-vector variable implementation for the constraint programming (CP) solver Gecode and its application to the problem of finding high-quality cryptographic substitution boxes (S-boxes). S-boxes are a component in some cryptographic protocols, for example DES, which are critical to the strength of the entire system. LÄS MER
