Abbreviations: H0, No hyponychium invasion; H1, Hyponychium invasion; NB0, No nail bed invasion; NB1, nail bed invasion; DNM0, no distal nail matrix invasion; DNM1, distal nail matrix invasion; PNM0, no proximal nail matrix invasion; PNM1, proximal nail matrix invasion; PNF0, no invasion in dorsal roof of proximal nail fold; PNF1, invasion in dorsal roof of proximal nail fold
* indicates significant differences according to the Mann-Whitney U test with p <0.05
† indicates significant differences in survival curve according to the log-rank test with p-value<0.05
These data sets contain benchmark instances for airport shuttle scheduling problem which is introduced in the paper titled "The Airport Shuttle Bus Scheduling Problem".
The Airport Shuttle Bus Scheduling Problem, ASBSP, the incoming passengers are transferred from the airport to the city center and the outgoing passengers are transferred from the city center to the airport using a number of identical, capacitated vehicles. The flight schedule and the number of passengers that uses the transfer service from each flight are known. The passengers have their associated ready times and due dates, which are associated with their flight times and allowable waiting times. Revenue is earned from each transferred customer. On the other hand, there is a transfer cost associated with empty and loaded transfers of the vehicle. Since this is a private company that aims to maximize the profit, it is possible to reject some customer requests (if it will result in low utilization of the vehicle). In order to maximize the utilization of the vehicles, it is also allowed to split or group the transfer requests of passengers from different flights without overriding allowable waiting time limits. The problem is to determine the schedule of the vehicles and the assignment of the passengers to these vehicles in order to maximize the total profit.
You can find the details about parameters used in the instances in "explanation.txt" file.
If you find any errors, want to comment, have any suggestions or have any additional benchmark instances, you are welcomed to share and write an e-mail to email@example.com or firstname.lastname@example.org or email@example.com.
Contributors:Simha Prithvi, Barton Melissa A., Magri Maria Elisa, Dutta Shanta, humayun kabir et al
This data set consists of anonymous survey responses to a standardized survey on attitudes towards recycling human urine as crop fertiliser. The survey was administered online in 2017 and 2018 to university community members from 20 universities in 16 countries, and resulted in 3,763 completed responses. The primary goal was to assess hypothetical willingness to buy and consume food grown with human urine as fertiliser, and the secondary goal was to identify potentially explanatory cross-cultural and country-specific factors. Both raw and cleaned data are provided here, as well as the survey instruments (English original and translated local versions). Data other than open-ended comments in the cleaned sheet (AllData.xlsx) were translated into English where necessary. An index to files and list of variables are given in IndexCodebook.pdf, and the survey methodology and data limitations are described in detail in a forthcoming Data in Brief paper (Barton et al., submitted).
In this paper, we take a closer look at Barnette's conjecture and at graph theory.This conjecture was named after professor David W. Barnette and states that every bipartite polyhedral graph with three edges per vertex has a Hamiltonian cycle.The complete definition of these terms in graph theory is included in our paper.We examine multiple types of graphs and polyhedral shapes and we proove or disproove them whether they satisfy the conjecture or not.Also, we worked on bipartite graphs, either complete or non-complete. We have constructed all the graphs on a Euclidean plane; we specifically studied planar cubic graphs.We explained every single aspect of the conjecture and we added some important examples.In addition, we represented almost all the graphs in two dimensional shapes, in order to study them more carefully.In conclusion, we did not manage to prove the conjecture , but our work might contribute a lot to future research on this specific topic.We included the references we used in our PDF file, at the end of our paper.We would like to think that this particular paper will help future researchers to find a valid and complete solution to this unsolved problem in mathematics.